IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v266y2018i2p426-435.html
   My bibliography  Save this article

On the optimality conditions of the two-machine flow shop problem

Author

Listed:
  • Hadda, Hatem
  • Dridi, Najoua
  • Hajji, Mohamed Karim

Abstract

This paper tackles the makespan minimization for the well known two-machine flow shop problem. Several optimality conditions are discussed aiming at the characterization of a large set of optimal solutions. We show that our approach dominates some of the results found in the literature. We also establish a number of necessary optimality conditions and discuss the asymptotic behavior of the optimal makespan when the number of jobs goes to infinity.

Suggested Citation

  • Hadda, Hatem & Dridi, Najoua & Hajji, Mohamed Karim, 2018. "On the optimality conditions of the two-machine flow shop problem," European Journal of Operational Research, Elsevier, vol. 266(2), pages 426-435.
    • Handle: RePEc:eee:ejores:v:266:y:2018:i:2:p:426-435
    DOI: 10.1016/j.ejor.2017.09.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717308500
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.09.029?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.

    References listed on IDEAS

    as
    1. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    2. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    3. Esswein, Carl & Billaut, Jean-Charles & Strusevich, Vitaly A., 2005. "Two-machine shop scheduling: Compromise between flexibility and makespan value," European Journal of Operational Research, Elsevier, vol. 167(3), pages 796-809, December.
    4. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    5. Briand, Cyril & La, H. Trung & Erschler, Jacques, 2006. "A new sufficient condition of optimality for the two-machine flowshop problem," European Journal of Operational Research, Elsevier, vol. 169(3), pages 712-722, March.
    6. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.
    2. Briand, Cyril & La, H. Trung & Erschler, Jacques, 2006. "A new sufficient condition of optimality for the two-machine flowshop problem," European Journal of Operational Research, Elsevier, vol. 169(3), pages 712-722, March.
    3. Artigues, Christian & Billaut, Jean-Charles & Esswein, Carl, 2005. "Maximization of solution flexibility for robust shop scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 314-328, September.
    4. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    5. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    6. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    7. Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    8. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
    9. Al-Hinai, Nasr & ElMekkawy, T.Y., 2011. "Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm," International Journal of Production Economics, Elsevier, vol. 132(2), pages 279-291, August.
    10. Thornton, Henry W. & Hunsucker, John L., 2004. "A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage," European Journal of Operational Research, Elsevier, vol. 152(1), pages 96-114, January.
    11. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    12. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    13. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    14. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    15. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    16. Ozelkan, Ertunga C. & Duckstein, Lucien, 1999. "Optimal fuzzy counterparts of scheduling rules," European Journal of Operational Research, Elsevier, vol. 113(3), pages 593-609, March.
    17. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    18. Antonina P. Khramova & Ilya Chernykh, 2021. "A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing," Journal of Scheduling, Springer, vol. 24(4), pages 405-412, August.
    19. Matin, Hossein N.Z. & Salmasi, Nasser & Shahvari, Omid, 2017. "Makespan minimization in flowshop batch processing problem with different batch compositions on machines," International Journal of Production Economics, Elsevier, vol. 193(C), pages 832-844.
    20. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.

    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:eee:ejores:v:266:y:2018:i:2:p:426-435. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.