Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties

Authors:
George Steiner;Rui Zhang
Affiliations:
DeGroote School of Business, McMaster University, Hamilton, Ontario L8S 4M4, Canada;DeGroote School of Business, McMaster University, Hamilton, Ontario L8S 4M4, Canada
Venue:
Operations Research
Year:
2011

Citing 4
Cited 1

Sequencing with earliness and tardiness penalties: a review

Operations Research
Supply chain scheduling: Batching and delivery

Operations Research
Two due date assignment problems in scheduling a single machine

Operations Research Letters
Improving the complexities of approximation algorithms for optimization problems

Operations Research Letters

A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are many situations in supply chain scheduling when the supplier finds it impossible to meet the promised due dates for some orders. We present a model for the rescheduling of orders with simultaneous assignment of attainable revised due dates to minimize due date escalation and tardiness penalties for the supplier. We show that the problem is equivalent to minimizing the total tardiness with rejection with respect to the original due dates. We prove that the problem is NP-hard and present a pseudopolynomial algorithm for it. We also present a fully polynomial time approximation scheme for the problem. Finally, we discuss the implications of our solution for setting fair tardiness penalties when due dates have to be renegotiated because of the delays.