Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

Authors:
Esaignani Selvarajah;George Steiner
Affiliations:
Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4;Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada L8S 4M4
Venue:
Operations Research
Year:
2009

Citing 10
Cited 1

Batching to minimize flow times on one machine

Management Science
One-pass batching algorithms for the one-machine problem

Discrete Applied Mathematics
Batch sizing and job sequencing on a single machine

Annals of Operations Research
The complexity of one-machine batching problems

Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Scheduling with Fixed Delivery Dates

Operations Research
Supply chain scheduling: Batching and delivery

Operations Research
Integrated Scheduling of Production and Distribution Operations

Management Science
Two Machine Scheduling under Disruptions with Transportation Considerations

Journal of Scheduling
Supply chain scheduling: sequence coordination

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems

Operations Research

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the upstream supplier's batch scheduling problem in a supply chain, which was defined by Hall and Potts [Hall, N. G., C. N. Potts. 2003. Supply chain scheduling: Batching and delivery. Oper. Res.51(4) 566--584]. The supplier has to manufacture multiple products and deliver them to customers in batches. There is an associated delivery cost with each batch. The objective of the supplier is to minimize the total inventory holding and delivery costs. We present simple approximation algorithms for this strongly NP-hard problem, which find a solution that is guaranteed to have a cost at most 3/2 times the minimum. We also prove that the approximation algorithms have worst-case bounds that vary parametrically with the data and that for realistic parameter values are much better than 3/2. The theoretical results are also supported by the findings of a computational study.