IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-030-91025-9_8.html
   My bibliography  Save this book chapter

Multiprocessor Open Shops

In: A Book of Open Shop Scheduling

Author

Listed:
  • Wieslaw Kubiak

    (Memorial University of Newfoundland)

Abstract

Two models of open shops with multiprocessors have been evolved: the single-operation machine and multiple-operation machine models. The former replaces a single machine in each stage by parallel machines, typically identical, but limits processing of an operation to machines from one stage. The latter permits processing an operation on a set of machines possibly from different stages. The research has focused mainly on makespan minimization. For the preemptive schedules the makespan minimization is done by a two-phase approach in polynomial time. The first phase optimally allocates operations to machines. The second phase applies algorithms for makespan minimization for preemptive open shops to find optimal schedules for the allocations. The approach gives polynomial-time algorithms for both models. The non-preemptive case is NP-hard in the strong sense. The chapter presents a 2-approximation algorithm for an arbitrary number of machines and reviews approximation schemes for a fixed number of stages for the case. Those approximation algorithms have been obtained for the single-operation machine model. Finally, the chapter reviews applications of multiprocessors to health care and other areas.

Suggested Citation

  • Wieslaw Kubiak, 2022. "Multiprocessor Open Shops," International Series in Operations Research & Management Science, in: A Book of Open Shop Scheduling, chapter 0, pages 193-203, Springer.
    • Handle: RePEc:spr:isochp:978-3-030-91025-9_8
    DOI: 10.1007/978-3-030-91025-9_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-3-030-91025-9_8. 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.