Article ID: | iaor2009249 |
Country: | Netherlands |
Volume: | 179 |
Issue: | 3 |
Start Page Number: | 656 |
End Page Number: | 676 |
Publication Date: | Jun 2007 |
Journal: | European Journal of Operational Research |
Authors: | McKeown G.P., Reynolds A.P. |
Keywords: | optimization: simulated annealing, simulation: applications |
A real-world, multi-stage, industrial scheduling problem is presented. An algorithm is described that converts a sequence of jobs into a complete schedule. Backward simulation is used to determine minimum storage requirements when scheduling each job, and to calculate the minimum amount of delay required. Combining this algorithm with a metaheuristic, such as simulated annealing, results in an effective algorithm for schedule optimization.