IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v23y2020i3d10.1007_s10951-019-00608-8.html
   My bibliography  Save this article

Two-machine flow shops with an optimal permutation schedule under a storage constraint

Author

Listed:
  • Yunhong Min

    (Incheon National University)

  • Byung-Cheon Choi

    (Chungnam National University)

  • Myoung-Ju Park

    (Kyung Hee University)

Abstract

We consider two-machine flow shop scheduling problems with storage to minimize the makespan. Under a storage constraint, each job has its own size, and the total size of the job(s) being processed on the machine(s) and the job(s) waiting for the second operation cannot exceed the given capacity. It is known that the computational complexity is strongly NP-hard and in general an optimal schedule does not exist in the set of schedules with the same job sequences on two machines, referred to as a permutation set. Thus, we consider two cases such that an optimal schedule exists in the permutation set. These two cases have the special structure of processing times. In the first case, the processing times of two machines for each job are identical, while in the second case, machine 2 dominates machine 1, that is, the smallest processing time of the second group of operations is larger than or equal to the largest one of the first group of operations. We show that the first case is strongly NP-hard and admits a polynomial-time approximation scheme (PTAS), while the second case is solved in polynomial time.

Suggested Citation

  • Yunhong Min & Byung-Cheon Choi & Myoung-Ju Park, 2020. "Two-machine flow shops with an optimal permutation schedule under a storage constraint," Journal of Scheduling, Springer, vol. 23(3), pages 327-336, June.
    • Handle: RePEc:spr:jsched:v:23:y:2020:i:3:d:10.1007_s10951-019-00608-8
    DOI: 10.1007/s10951-019-00608-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-019-00608-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-019-00608-8?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.

    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:jsched:v:23:y:2020:i:3:d:10.1007_s10951-019-00608-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.