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

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

    Research output: Contribution to journalArticleAcademicpeer-review

    77 Citations (Scopus)
    4 Downloads (Pure)

    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. 2] (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.
    Original languageEnglish
    Pages (from-to)25-41
    Number of pages17
    JournalStatistica Neerlandica
    Volume30
    Issue number1
    DOIs
    Publication statusPublished - 1976

    Fingerprint Dive into the research topics of 'Minimizing maximum lateness on one machine : computational experience and some applications'. Together they form a unique fingerprint.

    Cite this