Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling

P. S. Sundararaghavan and Mesbah U. Ahmed

Naval Research Logistics Quarterly, 1984, vol. 31, issue 2, 325-333

Abstract: Kanet addressed the problem of scheduling n jobs on one machine so as to minimize the sum of absolute lateness under a restrictive assumption on their common due date. This article extends the results to the problem of scheduling n jobs on m parallel identical processors in order to minimize the sum of absolute lateness. Also, a heuristic algorithm for a more general version with no restriction on the common due date, for the problem of n‐job single‐machine scheduling is presented and its performance is reported.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (7)

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

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:31:y:1984:i:2:p:325-333

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 ().