A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
From MaRDI portal
Publication:941536
DOI10.1016/j.cor.2006.07.006zbMath1180.90131OpenAlexW2052644869MaRDI QIDQ941536
Mansoor Sarhadi, Mohammad Mahdavi Mazdeh, Khalil S. Hindi
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.006
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs ⋮ 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 with release times and delivery costs ⋮ Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost ⋮ Scheduling and common due date assignment on a single parallel-batching machine with batch delivery ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Coordination of production and transportation in supply chain scheduling ⋮ Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
Cites Work
- Unnamed Item
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Single machine scheduling with batch deliveries
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Supply Chain Scheduling: Batching and Delivery
- On Scheduling with Ready Times to Minimize Mean Flow Time
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Machine scheduling with transportation considerations
This page was built for publication: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times