Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
From MaRDI portal
Publication:1374424
DOI10.1023/A:1018961818782zbMath0890.90091MaRDI QIDQ1374424
Reha Uzsoy, Suresh Chand, Rodney Traub
Publication date: 4 December 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (10)
Dominance-based heuristics for one-machine total cost scheduling problems ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Integration of production planning and scheduling based on RTN representation under uncertainties ⋮ A decomposition scheme for single stage scheduling problems ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem ⋮ An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines
This page was built for publication: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
