This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with re-entrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are required to reenter to the flow shop. The tardiness weight is adjusted once the jobs reenter to the shop. The performance of the proposed GA model is verified by a number of numerical experiments where the data come from the case company. The results show the proposed method has a higher order satisfaction rate than the current industrial practices.
|Number of pages||9|
|Journal||International Journal of Advanced Manufacturing Technology|
|Early online date||5 Apr 2011|
|Publication status||Published - 1 Oct 2011|
Bibliographical note© Springer-Verlag London Limited 2011. The final publication is available at Springer via http://dx.doi.org/10.1007/s00170-011-3251-4
- flow shop
- genetic algorithm