A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs

DOI10.1016/j.ejor.2006.09.087zbMath1128.90029MaRDI QIDQ2370330

Khalil S. Hindi, Mohammad Mahdavi Mazdeh, Mansoor Sarhadi

Publication date: 25 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.087

zbMATH Keywords

branch-and-bound algorithm; scheduling; single machine; batch delivery

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Single-machine batch scheduling minimizing weighted flow times and delivery costs, A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times, Scheduling with families of jobs and delivery coordination under job availability

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• Single machine scheduling with batch deliveries
• The complexity of one-machine batching problems
• One-machine batching and sequencing of multiple-type items
• Scheduling with batching: A review
• Supply Chain Scheduling: Batching and Delivery
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine