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

Two-Machine Open Shop Scheduling with Time Lags

In: A Book of Open Shop Scheduling

Author

Listed:
  • Wieslaw Kubiak

    (Memorial University of Newfoundland)

Abstract

We consider two-machine open shops with job-dependent time lags in this chapter. The time lags model transportation delays, intermediate processes, or operations that are not constrained by resources. We give a new proof of NP-hardness of makespan minimization for two-machine open shop with time lags and unit-time operations. We present a O ( n log n ) $$O(n \log n)$$ algorithm for a special case where all time lags are distinct. We observe that the algorithm produces ideal schedules that minimize makespan and total completion time at the same time. We then prove that the total completion time minimization is NP-hard in the strong sense for two-machine open shop with time lags and unit-time operations. This answers an open question. We review approximation algorithms for the makespan minimization problem, and inapproximability results for the problem with exact time lags. We also discuss some open problems.

Suggested Citation

  • Wieslaw Kubiak, 2022. "Two-Machine Open Shop Scheduling with Time Lags," International Series in Operations Research & Management Science, in: A Book of Open Shop Scheduling, chapter 0, pages 261-271, Springer.
    • Handle: RePEc:spr:isochp:978-3-030-91025-9_12
    DOI: 10.1007/978-3-030-91025-9_12
    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_12. 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.