Minimizing maximum lateness on one machine: computational experience and some applications

B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan

Statistica Neerlandica, 1976, vol. 30, issue 1, 25-41

Abstract: We consider the problem of scheduling jobs on a single machine subject to given release dates and precedence constraints, in order to minimize maximum lateness. The algorithms of Baker and Su (Naval Res. Logist. Quart. 21 (1974) 171–176) and of McMahon and Florian (Operations Res. 23 (1975) 475–482) for the problem without precedence constraints are extended to the general case. An extensive computational comparison establishes the superiority of the latter algorithm. We describe applications to the theory of job‐shop scheduling and to a practical scheduling situation.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1976.tb00264.x

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:bla:stanee:v:30:y:1976:i:1:p:25-41

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().