A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING
The aim of this paper is to propose genetic algorithm to finding the optimal schedule with minimum makespan for n jobs in flow shop environment with three machines. In this pape, a new approach for selection, a new crossover operation (3PLOX) and a new stopping criteria based on the lower bound of...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Computer Science and Mathematics, University of Mosul
2013-04-01
|
| Series: | المجلة العراقية للعلوم الاحصائية |
| Online Access: | https://stats.mosuljournals.com/article_75435_e211a5d57d5d85cb177cdc21173844bc.pdf |
| _version_ | 1811337257167093760 |
|---|---|
| author | MANAL ABDULKAREEM ZEIDAN |
| author_facet | MANAL ABDULKAREEM ZEIDAN |
| author_sort | MANAL ABDULKAREEM ZEIDAN |
| collection | DOAJ |
| description | The aim of this paper is to propose genetic algorithm to finding the optimal schedule with minimum makespan for n jobs in flow shop environment with three machines.
In this pape, a new approach for selection, a new crossover operation (3PLOX) and a new stopping criteria based on the lower bound of the makespan (LB) are proposed.Also, a new procedure of calculating the make span for n jobs at processing by three machine in flow shop environment is suggested. In order to examine the effectiveness of the proposed GA, a comparison was made with Johnson's algorithm. After the application on several problems which generated randomly by uniform distribution, the results showed that the proposed GA is better than Johnson's algorithm with rate 94% in finding the optimal sequence for scheduling jobs which gives optimal makespan. |
| first_indexed | 2024-04-13T17:51:16Z |
| format | Article |
| id | doaj.art-226811d6c5444fef94913074c1791443 |
| institution | Directory Open Access Journal |
| issn | 1680-855X 2664-2956 |
| language | Arabic |
| last_indexed | 2024-04-13T17:51:16Z |
| publishDate | 2013-04-01 |
| publisher | College of Computer Science and Mathematics, University of Mosul |
| record_format | Article |
| series | المجلة العراقية للعلوم الاحصائية |
| spelling | doaj.art-226811d6c5444fef94913074c17914432022-12-22T02:36:40ZaraCollege of Computer Science and Mathematics, University of Mosulالمجلة العراقية للعلوم الاحصائية1680-855X2664-29562013-04-01131112610.33899/iqjoss.2013.7543575435A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULINGMANAL ABDULKAREEM ZEIDANThe aim of this paper is to propose genetic algorithm to finding the optimal schedule with minimum makespan for n jobs in flow shop environment with three machines. In this pape, a new approach for selection, a new crossover operation (3PLOX) and a new stopping criteria based on the lower bound of the makespan (LB) are proposed.Also, a new procedure of calculating the make span for n jobs at processing by three machine in flow shop environment is suggested. In order to examine the effectiveness of the proposed GA, a comparison was made with Johnson's algorithm. After the application on several problems which generated randomly by uniform distribution, the results showed that the proposed GA is better than Johnson's algorithm with rate 94% in finding the optimal sequence for scheduling jobs which gives optimal makespan.https://stats.mosuljournals.com/article_75435_e211a5d57d5d85cb177cdc21173844bc.pdf |
| spellingShingle | MANAL ABDULKAREEM ZEIDAN A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING المجلة العراقية للعلوم الاحصائية |
| title | A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING |
| title_full | A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING |
| title_fullStr | A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING |
| title_full_unstemmed | A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING |
| title_short | A GENETIC ALGORITHM TO MINIMIZE THE MAKESPAN FOR THREE MACHINE FLOW SHOP SCHEDULING |
| title_sort | genetic algorithm to minimize the makespan for three machine flow shop scheduling |
| url | https://stats.mosuljournals.com/article_75435_e211a5d57d5d85cb177cdc21173844bc.pdf |
| work_keys_str_mv | AT manalabdulkareemzeidan ageneticalgorithmtominimizethemakespanforthreemachineflowshopscheduling AT manalabdulkareemzeidan geneticalgorithmtominimizethemakespanforthreemachineflowshopscheduling |