Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

DOI10.1002/(SICI)1520-6750(199608)43:5%3C709::AID-NAV7%3E3.0.CO;2-9MaRDI QIDQ5687644zbMATH OpenOpenAlexFDO

Authors Suresh Chand, Rodney Traub, Reha Uzsoy

Publication date 21 January 1997

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199608)43:5%3C709::aid-nav7%3E3.0.co;2-9

zbMATH Keywords

implicit enumerationsingle-machine dynamic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• A decomposition scheme for single stage scheduling problems
• Decomposition in single-machine scheduling
• Dynamic programming and decomposition approaches for the single machine total tardiness problem

Cited in

(17)

• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
• 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
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
• Dual decomposition of a single-machine scheduling problem
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• The single-node dynamic service scheduling and dispatching problem
• A mixed integer programming approach for the single machine problem with unequal release dates
• Improving schedule stability in single-machine rescheduling for new operation insertion
• Scheduling batch processing machines with incompatible job families
• Dynamic single-machine scheduling under distributed decision-making
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• A decomposition scheme for single stage scheduling problems

This page was built for publication: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

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