Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

Sankaran Lakshminarayan, Ram Lakshmanan, Robert L. Papineau and Rene Rochette
Additional contact information
Sankaran Lakshminarayan: University of Quebec, Trois-Rivieres, Quebec
Ram Lakshmanan: University of Quebec, Trois-Rivieres, Quebec
Robert L. Papineau: University of Quebec, Trois-Rivieres, Quebec
Rene Rochette: University of Quebec, Trois-Rivieres, Quebec

Operations Research, 1978, vol. 26, issue 6, 1079-1082

Abstract: We consider a single-machine scheduling problem where penalties occur for jobs that either commence before their target start date or are completed after their due date. The objective is to minimize the maximum penalty subject to certain assumptions on the target start times, due dates, and penalty functions. A more efficient algorithm than the existing one is presented for this problem. The number of computations in the proposed algorithm is of the order of n log n , while in the existing algorithm it is of the order of n 2 .

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.6.1079 (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:26:y:1978:i:6:p:1079-1082

Access Statistics for this article

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