IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i5p817-826.html
   My bibliography  Save this article

Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits

Author

Listed:
  • Qi Wei
  • Yong Wu
  • Yiwei Jiang
  • T.C.E. Cheng

Abstract

We study two-machine hybrid flowshop scheduling with identical jobs. Each job consists of two tasks, namely a flexible task and a fixed task. The flexible task can be processed on either machine, while the fixed task must be processed on the second machine. The fixed task can only be processed after the flexible task is finished. Due to different technological capabilities of the two machines, the flexible task has different processing times on the two machines. Our goal is to find a schedule that minimises the makespan. We consider two variants of the problem, namely no buffer and infinite buffer capacity between the two machines. We present constant-time solution algorithms for both variants. In addition, analysing the relationship between the hybrid benefits and performance difference between the two machines, we find that, for the infinite-buffer case, increasing the technological level of the second machine does not necessarily increase the hybrid benefits.

Suggested Citation

  • Qi Wei & Yong Wu & Yiwei Jiang & T.C.E. Cheng, 2019. "Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(5), pages 817-826, May.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:5:p:817-826
    DOI: 10.1080/01605682.2018.1458018
    as

    Download full text from publisher

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

    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:tjorxx:v:70:y:2019:i:5:p:817-826. 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/tjor .

    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.