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

A heuristic to minimize total flow time in permutation flow shop

Author

Listed:
  • Laha, Dipak
  • Sarin, Subhash C.

Abstract

In this paper, we address an n-job, m-machine permutation flow shop scheduling problem for the objective of minimizing the total flow time. We propose a modification of the best-known method of Framinan and Leisten [An efficient constructive heuristic for flowtime minimization in permutation flow shops. Omega 2003;31:311-7] for this problem. We show, through computational experimentation, that this modification significantly improves its performance while not affecting its time-complexity.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jomega:v:37:y:2009:i:3:p:734-739
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(08)00048-0
    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. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Simons, JV, 1992. "Heuristics in flow shop scheduling with sequence dependent setup times," Omega, Elsevier, vol. 20(2), pages 215-225, March.
    9. Huq, Faizul & Cutright, Kenneth & Martin, Clarence, 2004. "Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study," Omega, Elsevier, vol. 32(2), pages 121-129, April.
    10. 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.
    11. Kalir, Adar A. & Sarin, Subhash C., 2001. "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, Elsevier, vol. 29(6), pages 577-584, December.
    12. Sarin, S & Lefoka, M, 1993. "Scheduling heuristic for the n-jobm-machine flow shop," Omega, Elsevier, vol. 21(2), pages 229-234, March.
    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. 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.
    2. Li, Guo & Li, Na & Sambandam, Narayanasamy & Sethi, Suresh P. & Zhang, Faping, 2018. "Flow shop scheduling with jobs arriving at different times," International Journal of Production Economics, Elsevier, vol. 206(C), pages 250-260.
    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. Cha, Young-Ho & Kim, Yeong-Dae, 2010. "Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities," Omega, Elsevier, vol. 38(5), pages 383-392, October.
    5. 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.
    6. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    7. 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. 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.
    2. 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.
    3. 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.
    4. 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.
    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. 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.
    7. 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.
    8. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    9. 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.
    10. 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.
    11. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    12. 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.
    13. 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.
    14. 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.
    15. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    16. 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.
    17. 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.
    18. Agarwal, Anurag & Colak, Selcuk & Eryarsoy, Enes, 2006. "Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach," European Journal of Operational Research, Elsevier, vol. 169(3), pages 801-815, March.
    19. 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.
    20. Ciavotta, Michele & Minella, Gerardo & Ruiz, Rubén, 2013. "Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study," European Journal of Operational Research, Elsevier, vol. 227(2), pages 301-313.

    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:3:p:734-739. 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.