Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties

George Steiner () and Rui Zhang ()
Additional contact information
George Steiner: DeGroote School of Business, McMaster University, Hamilton, Ontario L8S 4M4, Canada
Rui Zhang: DeGroote School of Business, McMaster University, Hamilton, Ontario L8S 4M4, Canada

Operations Research, 2011, vol. 59, issue 6, 1504-1511

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 (N-script)(P-script)-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.

Keywords: production/scheduling; sequencing; deterministic; approximations/heuristic (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1110.0948 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:59:y:2011:i:6:p:1504-1511

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().