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

Efficient composite heuristics for total flowtime minimization in permutation flow shops

Author

Listed:
  • Li, Xiaoping
  • Wang, Qian
  • Wu, Cheng

Abstract

In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a schedule by inheriting temporal parameters from its parent in the unchanged part and computes only those of the changed part. Iterative methods and LR (developed by Liu J, Reeves, CR. Constructive and composite heuristic solutions to theP[short parallel][Sigma]Ci scheduling problem, European Journal of Operational Research 2001; 132:439-52) are evaluated and compared as solution improvement phase and index development phase. Three composite heuristics are proposed in this paper by integrating forward pair-wise exchange-restart (FPE-R) and FPE with an effective iterative method. Computational results show that the proposed three outperform the best existing three composite heuristics in effectiveness and two of them are much faster than the existing ones.

Suggested Citation

  • Li, Xiaoping & Wang, Qian & Wu, Cheng, 2009. "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, Elsevier, vol. 37(1), pages 155-164, February.
    • Handle: RePEc:eee:jomega:v:37:y:2009:i:1:p:155-164
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(06)00148-4
    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. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    2. Allahverdi, Ali & Aldowaisan, Tariq, 2002. "New heuristics to minimize total completion time in m-machine flowshops," International Journal of Production Economics, Elsevier, vol. 77(1), pages 71-83, May.
    3. Aldowaisan, Tariq & Allahverdi, Ali, 2004. "New heuristics for m-machine no-wait flowshop to minimize total completion time," Omega, Elsevier, vol. 32(5), pages 345-352, October.
    4. Rajendran, Chandrasekharan, 1993. "Heuristic algorithm for scheduling in a flowshop to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 29(1), pages 65-73, February.
    5. Rajendran, Chandrasekharan & Ziegler, Hans, 2004. "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 155(2), pages 426-438, June.
    6. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    7. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    8. Rajendran, Chandrasekharan & Ziegler, Hans, 1997. "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 103(1), pages 129-138, November.
    9. 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.
    10. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    11. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    12. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    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. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    2. Fernandez-Viagas, Victor & Molina-Pariente, Jose M. & Framinan, Jose M., 2020. "Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 282(3), pages 858-872.
    3. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    4. Yunhe Wang & Xiangtao Li & Zhiqiang Ma, 2017. "A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion," Sustainability, MDPI, vol. 9(12), pages 1-35, December.
    5. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
    6. Han, Yuyan & Wang, Yuting & Pan, Quan-ke & Wang, Ling & Tasgetiren, M. Fatih, 2024. "Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach," European Journal of Operational Research, Elsevier, vol. 318(2), pages 424-441.
    7. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
    8. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    9. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.

    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. 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.
    2. K Sheibani, 2010. "A fuzzy greedy heuristic for permutation flow-shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 813-818, May.
    3. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    4. M S Nagano & J V Moccellin, 2008. "Reducing mean flow time in permutation flow shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 939-945, July.
    5. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    6. Laha, Dipak & Sarin, Subhash C., 2009. "A heuristic to minimize total flow time in permutation flow shop," Omega, Elsevier, vol. 37(3), pages 734-739, June.
    7. Zhang, Yi & Li, Xiaoping & Wang, Qian, 2009. "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," European Journal of Operational Research, Elsevier, vol. 196(3), pages 869-876, August.
    8. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    9. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    10. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 127(1), pages 121-128, September.
    11. Framinan, Jose M. & Leisten, Rainer & Ruiz-Usano, Rafael, 2002. "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, Elsevier, vol. 141(3), pages 559-569, September.
    12. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    13. Varadharajan, T.K. & Rajendran, Chandrasekharan, 2005. "A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 772-795, December.
    14. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    15. Rajendran, Chandrasekharan & Ziegler, Hans, 2001. "A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs," European Journal of Operational Research, Elsevier, vol. 131(3), pages 622-634, June.
    16. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.
    17. Rajendran, Chandrasekharan & Ziegler, Hans, 2004. "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 155(2), pages 426-438, June.
    18. Liu, Jiyin & Reeves, Colin R, 2001. "Constructive and composite heuristic solutions to the P//[summation operator]Ci scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(2), pages 439-452, July.
    19. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    20. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.

    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:37:y:2009:i:1:p:155-164. 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.