Some simple scheduling algorithms

W. A. Horn

Naval Research Logistics Quarterly, 1974, vol. 21, issue 1, 177-185

Abstract: This paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty‐free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single‐machine case, and maximum lateness for a restricted multi‐machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine case.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (11) Track citations by RSS feed

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

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:21:y:1974:i:1:p:177-185

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 (contentdelivery@wiley.com).