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

Authors:
George Steiner;Rui Zhang
Affiliations:
Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Canada;Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Canada
Venue:
Journal of Scheduling
Year:
2009

Citing 6
Cited 0

Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Supply chain scheduling: Batching and delivery

Operations Research
Integrated Scheduling of Production and Distribution Operations

Management Science
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 the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a supply chain scheduling problem in which n jobs have to be scheduled on a single machine and delivered to m customers in batches. Each job has a due date, a processing time and a lateness penalty (weight). To save batch-delivery costs, several jobs for the same customer can be delivered together in a batch, including late jobs. The completion time of each job in the same batch coincides with the batch completion time. A batch setup time has to be added before processing the first job in each batch. The objective is to find a schedule which minimizes the sum of the weighted number of late jobs and the delivery costs. We present a pseudo-polynomial algorithm for a restricted case, where late jobs are delivered separately, and show that it becomes polynomial for the special cases when jobs have equal weights and equal delivery costs or equal processing times and equal setup times. We convert the algorithm into an FPTAS and prove that the solution produced by it is near-optimal for the original general problem by performing a parametric analysis of its performance ratio.