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

DOI10.1023/A:1018961818782MaRDI QIDQ1374424zbMATH OpenFDO

Authors Suresh Chand, Rodney Traub, Reha Uzsoy

Publication date 4 December 1997

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

single machinerelease timesminimizing total completion timerolling horizon procedures

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• A hybrid heuristic approach for single machine scheduling with release times

Cited in

(11)

• Terminal penalty rolling scheduling based on an initial schedule for single-machine 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
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Dominance-based heuristics for one-machine total cost scheduling problems
• A decomposition scheme for single stage scheduling problems
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines
• Integration of production planning and scheduling based on RTN representation under uncertainties
• 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.

This page was built for publication: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374424)