IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v42y2010i7p525-537.html
   My bibliography  Save this article

Parallel machine scheduling with s-precedence constraints

Author

Listed:
  • Eun-Seok Kim
  • Marc Posner

Abstract

For s-precedence constraints, job i cannot start processing until all jobs that precede i start. This is different from the standard definition of a precedence relation where i cannot start until all prior jobs complete. While not discussed in the scheduling literature, s-precedence constraints have wide applicability in real-world settings such as first-come, first-served processing systems. This article considers a deterministic scheduling problem where jobs with s-precedence relations are processed by multiple identical parallel machines. The objective is to minimize the makespan. The problem is shown to be intractable. A heuristic procedure is developed and tight worst-case bounds on the relative error are derived. Finally, computational experiments show that the proposed heuristic provides effective solutions.

Suggested Citation

  • Eun-Seok Kim & Marc Posner, 2010. "Parallel machine scheduling with s-precedence constraints," IISE Transactions, Taylor & Francis Journals, vol. 42(7), pages 525-537.
  • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:7:p:525-537
    DOI: 10.1080/07408171003670975
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/07408171003670975
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/07408171003670975?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. Zhang, An & Qi, Xiangtong & Li, Guanhua, 2020. "Machine scheduling with soft precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 491-505.
    2. Youngbum Hur & Jonathan F. Bard & Douglas J. Morrice, 2021. "Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 134-155, February.

    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:taf:uiiexx:v:42:y:2010:i:7:p:525-537. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.