IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v69y1997i0p171-19110.1023-a1018976827443.html
   My bibliography  Save this article

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

Author

Listed:
  • J.N.D. Gupta
  • A.M.A. Hariri
  • C.N. Potts

Abstract

This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage contains several identical machines, and the second stage contains a single machine. Each job is to be processed on one of the first-stage machines, and then on the second-stage machine. The objective is to find a schedule which minimizes the maximum completion time or makespan. The problem is NP-hard in the strong sense, even when there are two machines at the first stage. Several lower bounds are derived and are tested in a branch and bound algorithm. Also, constructive heuristics are presented, and a descent algorithm is proposed. Extensive computational tests with up to 250 jobs, and up to 10 machines in the first stage, indicate that some of the heuristics consistently generate optimal or near-optimal solutions. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • J.N.D. Gupta & A.M.A. Hariri & C.N. Potts, 1997. "Scheduling a two-stage hybrid flow shop with parallel machines at the first stage," Annals of Operations Research, Springer, vol. 69(0), pages 171-191, January.
    • Handle: RePEc:spr:annopr:v:69:y:1997:i:0:p:171-191:10.1023/a:1018976827443
    DOI: 10.1023/A:1018976827443
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018976827443
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018976827443?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. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    2. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    3. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    4. Zhang, Xiandong & van de Velde, Steef, 2012. "Approximation algorithms for the parallel flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(3), pages 544-552.
    5. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    6. Jin, Zhihong & Yang, Zan & Ito, Takahiro, 2006. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 100(2), pages 322-334, April.
    7. Oguz, C. & Fikret Ercan, M. & Edwin Cheng, T. C. & Fung, Y. F., 2003. "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop," European Journal of Operational Research, Elsevier, vol. 149(2), pages 390-403, September.
    8. Wilson, Amy D. & King, Russell E. & Wilson, James R., 2004. "Case study on statistically estimating minimum makespan for flow line scheduling problems," European Journal of Operational Research, Elsevier, vol. 155(2), pages 439-454, June.
    9. Sung, C.S. & Kim, Hyun Ah, 2008. "A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times," International Journal of Production Economics, Elsevier, vol. 113(2), pages 1038-1048, June.

    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:annopr:v:69:y:1997:i:0:p:171-191:10.1023/a:1018976827443. 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.