Single-machine batch scheduling minimizing weighted flow times and delivery costs

DOI10.1016/j.apm.2010.07.023zbMath1202.90140OpenAlexW1973151344MaRDI QIDQ614457

Sara Shashaani, Armin Ashouri, Khalil S. Hindi, Mohammad Mahdavi Mazdeh

Publication date: 27 December 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.07.023

zbMATH Keywords

schedulingbranch-and-boundsingle machinebatch deliveryweighted flow times

Mathematics Subject Classification ID

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

Related Items (12)

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 ⋮ Coordinating multi-location production and customer delivery ⋮ Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost ⋮ Scheduling in a two-stage supply chain with uncertain parameters ⋮ Scheduling and common due date assignment on a single parallel-batching machine with batch delivery ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

Cites Work

• Unnamed Item
• Batch delivery scheduling with batch delivery cost on a single machine
• One-pass batching algorithms for the one-machine problem
• The complexity of one-machine batching problems
• One-machine batching and sequencing of multiple-type items
• A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
• Single machine scheduling with release dates and job delivery to minimize the makespan
• Supply Chain Scheduling: Batching and Delivery
• Machine scheduling with transportation considerations

This page was built for publication: Single-machine batch scheduling minimizing weighted flow times and delivery costs