IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i4p1094-1097.html
   My bibliography  Save this article

Two-stage flow shop scheduling with dedicated machines

Author

Listed:
  • Bertrand M.T. Lin

Abstract

This study is concerned with the manufacturing model that has a common machine at stage one and two parallel dedicated machines at stage two. All jobs need to be processed on the stage-one common machine. After the stage-one processing, the jobs of type 1 (type 2) will route to the first (second) dedicated machine at stage two. We first elaborate several published works on makespan minimisation which are not known to other streams of recent works. While the minimisation of maximum lateness is strongly NP-hard, we develop a linear-time algorithm to solve the case where two sequences of the two job types are given a priori.

Suggested Citation

  • Bertrand M.T. Lin, 2015. "Two-stage flow shop scheduling with dedicated machines," International Journal of Production Research, Taylor & Francis Journals, vol. 53(4), pages 1094-1097, February.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:4:p:1094-1097
    DOI: 10.1080/00207543.2014.944631
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.944631
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.944631?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. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.

    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:tprsxx:v:53:y:2015:i:4:p:1094-1097. 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/TPRS20 .

    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.