Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs

DOI10.1007/s10951-005-6365-4zbMath1154.90434OpenAlexW2138337267MaRDI QIDQ2464440

H. A. J. Crauwels, Chris N. Potts, Dirk D. L. van Oudheusden, Luk N. Van Wassenhove

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-6365-4

zbMATH Keywords

schedulingbranch and boundsingle machinefamiliesbatchesset-up time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Scheduling with batching: A review ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

Cites Work

• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Scheduling with batching: A review
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs