Article ID: | iaor2009262 |
Country: | United Kingdom |
Volume: | 46 |
Issue: | 4 |
Start Page Number: | 993 |
End Page Number: | 1016 |
Publication Date: | Jan 2008 |
Journal: | International Journal of Production Research |
Authors: | Millas V.S., Vosniakos G.-C. |
Keywords: | heuristics: genetic algorithms |
This paper examines scheduling in a manufacturing system with transfer batches. Transfer batches are considered as different batches although they stem from the same job. Genetic algorithms determine the size of the transfer batches for each job and the final schedule with a makespan criterion. A novelty of the genetic algorithm developed is twin chromosome encoding, the first chromosome representing the relative size (participation ratio) of each transfer batch with respect to the whole batch; and the second chromosome applying in effect a dynamic heuristic dispatching rule representation for resolving operation antagonism. New crossover and mutation operators were employed for the first chromosome and standard operators for the second.