Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 656-676 |
Number of pages | 21 |
Journal | European Journal of Operational Research |
Volume | 179 |
Issue number | 3 |
DOIs | |
Publication status | Published - Jun 2007 |