Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

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)

zbMATH Keywords

single machine; release times; minimizing total completion time; rolling horizon procedures

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, A decomposition scheme for single stage scheduling problems, 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, 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, Dominance-based heuristics for one-machine total cost scheduling problems