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 |