Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483146 | European Journal of Operational Research | 2007 | 21 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A.P. Reynolds, G.P. McKeown,