Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
From MaRDI portal
Publication:1273118
DOI10.1023/A:1018920416308zbMath0913.90164MaRDI QIDQ1273118
A. M. A. Hariri, H. A. J. Crauwels, Luk N. Van Wassenhove, Chris N. Potts
Publication date: 7 March 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Lagrangian relaxationsingle-machine schedulingbranch-and-boundlower boundbatchingtotal weighted completion timeset-up time
Related Items
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs ⋮ Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Scheduling with batching: A review ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ Approximation algorithms for problems in scheduling with set-ups ⋮ An online algorithm for a problem in scheduling with set-ups and release times ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
