IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v29y2001i6p599-608.html
   My bibliography  Save this article

Heuristic algorithms for the two-machine flowshop with limited machine availability

Author

Listed:
  • Blazewicz, Jacek
  • Breit, Joachim
  • Formanowicz, Piotr
  • Kubiak, Wieslaw
  • Schmidt, Günter

Abstract

The paper studies a flowshop scheduling problem where machines are not available in given time intervals. The objective is to minimize the makespan. The problem is known to be NP-hard for two machines. We analyze constructive and local search based heuristic algorithms for the two-machine case. The algorithms are tested on easy and difficult test problems with up to 100 jobs and 10 intervals of non-availability. Computational results show that the algorithms perform well. For many problems an optimum solution is found.

Suggested Citation

  • Blazewicz, Jacek & Breit, Joachim & Formanowicz, Piotr & Kubiak, Wieslaw & Schmidt, Günter, 2001. "Heuristic algorithms for the two-machine flowshop with limited machine availability," Omega, Elsevier, vol. 29(6), pages 599-608, December.
    • Handle: RePEc:eee:jomega:v:29:y:2001:i:6:p:599-608
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(01)00048-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    2. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    3. Ogbu, FA & Smith, DK, 1991. "Simulated annealing for the permutation flowshop problem," Omega, Elsevier, vol. 19(1), pages 64-67.
    4. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
    2. Aggoune, Riad, 2004. "Minimizing the makespan for the flow shop scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 153(3), pages 534-543, March.
    3. Drótos, Márton & Erdos, Gábor & Kis, Tamás, 2009. "Computing lower and upper bounds for a large-scale industrial job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 296-306, August.
    4. Aggoune, Riad & Portmann, Marie-Claude, 2006. "Flow shop scheduling problem with limited machine availability: A heuristic approach," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 4-15, February.
    5. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    6. C.T. Ng & Mikhail Y. Kovalyov, 2004. "An FPTAS for scheduling a two‐machine flowshop with one unavailability interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 307-315, April.
    7. 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.
    8. Leong, Wei Dong & Teng, Sin Yong & How, Bing Shen & Ngan, Sue Lin & Lam, Hon Loong & Tan, Chee Pin & Ponnambalam, S. G., 2019. "Adaptive Analytical Approach to Lean and Green Operations," MPRA Paper 95449, University Library of Munich, Germany, revised 20 May 2019.
    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.

    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. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    3. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    4. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    5. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    6. Fatima Benbouzid-Si Tayeb & Karima Benatchba & Abd-Essalam Messiaid, 2018. "Game theory-based integration of scheduling with flexible and periodic maintenance planning in the permutation flowshop sequencing problem," Operational Research, Springer, vol. 18(1), pages 221-255, April.
    7. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    8. W Q Huang & L Wang, 2006. "A local search method for permutation flow shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1248-1251, October.
    9. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    10. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    11. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    12. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    13. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    14. Rad, Shahriar Farahmand & Ruiz, Rubén & Boroojerdian, Naser, 2009. "New high performing heuristics for minimizing makespan in permutation flowshops," Omega, Elsevier, vol. 37(2), pages 331-345, April.
    15. Rajendran, Chandrasekharan, 1995. "Heuristics for scheduling in flowshop with multiple objectives," European Journal of Operational Research, Elsevier, vol. 82(3), pages 540-555, May.
    16. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2005. "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics," European Journal of Operational Research, Elsevier, vol. 165(1), pages 34-54, August.
    17. He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
    18. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    19. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    20. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.

    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:jomega:v:29:y:2001:i:6:p:599-608. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.