Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejor.2005.03.053 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Simulated annealing,Simulation | Production manager,Simulated annealing,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Factory,Scheduling (computing),Real-time computing,Schedule,Operations management,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
179 | 3 | 0377-2217 |
Citations | PageRank | References |
1 | 0.46 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. P. Reynolds | 1 | 1 | 0.46 |
| G. P. Mckeown | 2 | 53 | 9.29 |