IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v328y2023i2d10.1007_s10479-023-05324-3.html
   My bibliography  Save this article

Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown

Author

Listed:
  • Faicel Hnaien

    (University of Technology of Troyes)

  • Taha Arbaoui

    (University of Technology of Troyes)

Abstract

This paper studies a two-machine flow shop scheduling problem with availability constraints due to a breakdown on the first machine. The starting time of the breakdown is considered stochastic and follows a known probability distribution. A service-level constraint is introduced to model the guarantee with which the obtained schedule takes into account the stochastic nature of the breakdown’s starting time. The objective is to find a solution that minimizes the makespan while satisfying the desired service level. The studied problem is strongly NP-hard. We develop two mixed integer linear models that linearize the non-linear model. Using interval modeling of the breakdown, we propose lower bounds and a valid inequality that are used to strengthen both models. When the lower bounds and the valid inequality are applied, the performance of both models is greatly improved by reducing the gap and reaching optimality for more instances. We also introduced two heuristics that exploit the proposed interval modeling. The computational results indicate that both models are able to reach optimality for the 10-job instances. Moreover, the comparisons results between both models with the two heuristics showed their effectiveness.

Suggested Citation

  • Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    • Handle: RePEc:spr:annopr:v:328:y:2023:i:2:d:10.1007_s10479-023-05324-3
    DOI: 10.1007/s10479-023-05324-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05324-3
    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/s10479-023-05324-3?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. Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
    2. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    3. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    4. Mourad Benttaleb & Faicel Hnaien & Farouk Yalaoui, 2019. "Minimising the makespan in the two-machine job shop problem under availability constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 57(5), pages 1427-1457, March.
    5. Allahverdi, Ali & Mittenthal, John, 1995. "Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function," European Journal of Operational Research, Elsevier, vol. 81(2), pages 376-387, March.
    6. Portougal, Victor & Trietsch, Dan, 2006. "Johnson's problem with stochastic processing times and optimal service level," European Journal of Operational Research, Elsevier, vol. 169(3), pages 751-760, March.
    7. C. T. Ng & Natalja M. Matsveichuk & Yuri N. Sotskov & T. C. Edwin Cheng, 2009. "Two-Machine Flow-Shop Minimum-Length Scheduling With Interval Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(06), pages 715-734.
    8. Nadarajah, Saralees & Kotz, Samuel, 2006. "R Programs for Truncated Distributions," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 16(c02).
    9. Lee, Chung-Yee, 1999. "Two-machine flowshop scheduling with availability constraints," European Journal of Operational Research, Elsevier, vol. 114(2), pages 420-429, April.
    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. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    2. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    3. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    4. Berti, Nicola & Finco, Serena & Battaïa, Olga & Delorme, Xavier, 2021. "Ageing workforce effects in Dual-Resource Constrained job-shop scheduling," International Journal of Production Economics, Elsevier, vol. 237(C).
    5. Dawei Li & Xiwen Lu, 2020. "Two-machine flow shop scheduling with an operator non-availability period to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1060-1078, May.
    6. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
    7. Alexey Matveev & Varvara Feoktistova & Ksenia Bolshakova, 2016. "On Global Near Optimality of Special Periodic Protocols for Fluid Polling Systems with Setups," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 1055-1070, December.
    8. Shichang Xiao & Zigao Wu & Hongyan Dui, 2022. "Resilience-Based Surrogate Robustness Measure and Optimization Method for Robust Job-Shop Scheduling," Mathematics, MDPI, vol. 10(21), pages 1-22, October.
    9. Allaoui, H. & Lamouri, S. & Artiba, A. & Aghezzaf, E., 2008. "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 161-167, March.
    10. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    11. Allaoui, Hamid & Artiba, AbdelHakim, 2009. "Johnson's algorithm: A key to solve optimally or approximately flow shop scheduling problems with unavailability periods," International Journal of Production Economics, Elsevier, vol. 121(1), pages 81-87, September.
    12. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    13. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    14. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    15. Tan, Zhiyi & Chen, Yong & Zhang, An, 2013. "On the exact bounds of SPT for scheduling on parallel machines with availability constraints," International Journal of Production Economics, Elsevier, vol. 146(1), pages 293-299.
    16. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    17. Rhonda Righter, 1997. "A generalized Johnson's rule for stochastic assembly systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(2), pages 211-220, March.
    18. Fabio Clementi & Mauro Gallegati & Giorgio Kaniadakis, 2012. "A new model of income distribution: the κ-generalized distribution," Journal of Economics, Springer, vol. 105(1), pages 63-91, January.
    19. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    20. Alejandra Duenas & Dobrila Petrovic, 2008. "An approach to predictive-reactive scheduling of parallel machines subject to disruptions," Annals of Operations Research, Springer, vol. 159(1), pages 65-82, March.

    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:328:y:2023:i:2:d:10.1007_s10479-023-05324-3. 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: 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.