IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v49y1999i2p211-219.html
   My bibliography  Save this article

Scheduling identical jobs with chain precedence constraints on two uniform machines

Author

Listed:
  • Peter Brucker
  • Johann Hurink
  • Wieslaw Kubiak

Abstract

The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999

Suggested Citation

  • Peter Brucker & Johann Hurink & Wieslaw Kubiak, 1999. "Scheduling identical jobs with chain precedence constraints on two uniform machines," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(2), pages 211-219, April.
    • Handle: RePEc:spr:mathme:v:49:y:1999:i:2:p:211-219
    DOI: 10.1007/PL00020913
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/PL00020913
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/PL00020913?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    2. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    3. Xing Chai & Wenhua Li, 2018. "Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 472-492, August.
    4. Faramroze G. Engineer & Pınar Keskinocak & Larry K. Pickering, 2009. "OR Practice---Catch-Up Scheduling for Childhood Vaccination," Operations Research, INFORMS, vol. 57(6), pages 1307-1319, December.

    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:spr:mathme:v:49:y:1999:i:2:p:211-219. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.