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.90029OpenAlexW2015072017MaRDI QIDQ2370330

Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi

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 algorithmschedulingsingle machinebatch delivery

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A knowledge-based approach for multi-factory production systems ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ Single-machine batch scheduling minimizing weighted flow times and delivery costs ⋮ Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost ⋮ A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ Minimizing maximum tardiness and delivery costs 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

This page was built for publication: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs