Minimizing the average deviation of job completion times about a common due date

John J. Kanet

Naval Research Logistics Quarterly, 1981, vol. 28, issue 4, 643-651

Abstract: This paper considers a single‐machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
https://doi.org/10.1002/nav.3800280411

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:wly:navlog:v:28:y:1981:i:4:p:643-651

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().