IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v30y1976i1p25-41.html
   My bibliography  Save this article

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

Author

Listed:
  • B. J. Lageweg
  • J. K. Lenstra
  • A. H. G. Rinnooy Kan

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.

Suggested Citation

  • B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan, 1976. "Minimizing maximum lateness on one machine: computational experience and some applications," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 30(1), pages 25-41, March.
    • Handle: RePEc:bla:stanee:v:30:y:1976:i:1:p:25-41
    DOI: 10.1111/j.1467-9574.1976.tb00264.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.1976.tb00264.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.1976.tb00264.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maciej Drozdowski & Florian Jaehn & Radosław Paszkowski, 2017. "Scheduling Position-Dependent Maintenance Operations," Operations Research, INFORMS, vol. 65(6), pages 1657-1677, December.
    2. Alexander A. Lazarev & Nikolay Pravdivets & Frank Werner, 2020. "On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty," Mathematics, MDPI, vol. 8(7), pages 1-15, July.
    3. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    4. Lancia, Giuseppe, 2000. "Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 120(2), pages 277-288, January.
    5. Dauzere-Peres, Stephane, 1995. "A procedure for the one-machine sequencing problem with dependent jobs," European Journal of Operational Research, Elsevier, vol. 81(3), pages 579-589, March.
    6. Pan, Yunpeng & Shi, Leyuan, 2006. "Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 1030-1039, February.
    7. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
    8. Helena Ramalhinho-Lourenço, 1998. "A polynomial algorithm for special case of the one-machine scheduling problem with time-lags," Economics Working Papers 339, Department of Economics and Business, Universitat Pompeu Fabra.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:30:y:1976:i:1:p:25-41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.