Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476198 | Computers & Operations Research | 2008 | 16 Pages |
Abstract
We address the problem of scheduling a single machine subject to family-dependent set-up times in order to minimize maximum lateness. We present a number of local improvement heuristics based on the work of previous researchers, a rolling horizon heuristic, and an incomplete dynamic programming heuristic. Extensive computational experiments on randomly generated test problems compare the performance of these heuristics. The rolling horizon procedures perform particularly well but require their parameters to be set based on problem characteristics to obtain their best performance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Reha Uzsoy, Juan Diego Velásquez,