IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v31y1983i2p381-386.html
   My bibliography  Save this article

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints

Author

Listed:
  • K. R. Baker

    (Dartmouth College, Hanover, New Hampshire)

  • E. L. Lawler

    (University of California, Berkeley, California)

  • J. K. Lenstra

    (Mathematisch Centrum, Amsterdam, The Netherlands)

  • A. H. G. Rinnooy Kan

    (Erasmus University, Rotterdam, The Netherlands)

Abstract

Suppose n jobs are to be processed on a single machine, subject to release dates and precedence constraints. The problem is to find a preemptive schedule which minimizes the maximum job completion cost. We present an O ( n 2 ) algorithm for this problem, generalizing previous results of E. L. Lawler.

Suggested Citation

  • K. R. Baker & E. L. Lawler & J. K. Lenstra & A. H. G. Rinnooy Kan, 1983. "Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints," Operations Research, INFORMS, vol. 31(2), pages 381-386, April.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:2:p:381-386
    DOI: 10.1287/opre.31.2.381
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.2.381
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.2.381?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. Janiak, Adam & Kovalyov, Mikhail Y., 2006. "Scheduling in a contaminated area: A model and polynomial algorithms," European Journal of Operational Research, Elsevier, vol. 173(1), pages 125-132, August.
    2. Cepek, Ondrej & Okada, Masanori & Vlach, Milan, 2002. "Nonpreemptive flowshop scheduling with machine dominance," European Journal of Operational Research, Elsevier, vol. 139(2), pages 245-261, June.
    3. Serafini, Paolo, 2006. "Dynamic programming and minimum risk paths," European Journal of Operational Research, Elsevier, vol. 175(1), pages 224-237, November.
    4. Maciej Drozdowski & Florian Jaehn & Radosław Paszkowski, 2017. "Scheduling Position-Dependent Maintenance Operations," Operations Research, INFORMS, vol. 65(6), pages 1657-1677, December.
    5. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    6. Liang-Liang Fu & Mohamed Ali Aloulou & Christian Artigues, 2018. "Integrated production and outbound distribution scheduling problems with job release dates and deadlines," Journal of Scheduling, Springer, vol. 21(4), pages 443-460, August.
    7. C. Sriskandarajah, 1990. "A note on the generalized due dates scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 587-597, August.
    8. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    9. Nicholas G. Hall & Zhixin Liu & Chris N. Potts, 2007. "Rescheduling for Multiple New Orders," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 633-645, November.
    10. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    11. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.
    12. Philippe Chrétienne, 2016. "On scheduling with the non-idling constraint," Annals of Operations Research, Springer, vol. 240(1), pages 301-319, May.

    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:inm:oropre:v:31:y:1983:i:2:p:381-386. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.