Skip to main content
SpringerLink
Log in

A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper considers the permutation flowshop scheduling problem with sequence-dependent set-up times and develops a penalty-based heuristic algorithm to find an approximately minimum makespan schedule. The proposed algorithm determines the penalty in time associated with a particular sequence and selects the sequence with the minimum time penalty as the best heuristic solution. Computational results comparing the effectiveness and efficiency of the proposed penalty-based heuristic algorithm with an existing savings index heuristic algorithm are reported and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Allahverdi A, Gupta JND and Aldowaisan T (1999). A review of scheduling research involving setup considerations. OMEGA 27: 219–239.

    Article  Google Scholar 

  • Campbell HG, Dudek RA and Smith ML (1970). A heuristic algorithm for the n job, m machine sequencing problem. Mngt Sci 16: B630–B637.

    Article  Google Scholar 

  • Chen B, Potts CN and Woeginger GJ (1998). A review of machine scheduling: complexity, algorithms and applications. In: Du D-Z and Pardalos PM (eds). Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht, Netherlands, pp 21–169.

    Google Scholar 

  • Cheng TCE, Gupta JND and Wang G (2000). A review of flowshop scheduling research with setup times. Prod Opns Mngt 9: 283–302.

    Google Scholar 

  • Daniel WW (1978). Applied Nonparametric Statistics. Houghton Mifflin: Boston, MA.

    Google Scholar 

  • Dannenbring DG (1977). An evaluation of flowshop sequencing heuristics. Mngt Sci 23: 1174–1182.

    Article  Google Scholar 

  • Das SR, Gupta JND and Khumawala BM (1995). A savings index heuristic algorithm for flowshop scheduling with sequence dependent setup times. J Opl Res Soc 46: 1365–1373. Also, see their Corrigendum, J Opl Res Soc 55 2004, p 1369.

    Article  Google Scholar 

  • Flynn B (1987). Repetitive Lots: The use of sequence-dependent set-up time scheduling procedure in group technology and traditional shops. J Opns Mngt 7: 203–216.

    Google Scholar 

  • Gupta JND and Darrow WP (1986). Two machine sequence dependent flowshop scheduling problem. Eur J Opl Res 24: 439–446.

    Article  Google Scholar 

  • Hall NG and Posner ME (2001). Generating experimental data for scheduling problems. Opns Res 49: 854–865.

    Article  Google Scholar 

  • Hill JA, Berry WL and Schilling DA (1987). Revising the master production schedule in sequence dependent processes. Int J Prod Res 41: 2021–2035.

    Article  Google Scholar 

  • Johnson SM (1954). Optimal two- and three- stage production schedules with set-up times included. Naval Research Logistics Quar 1: 61–68.

    Article  Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory. North-Holland, Amsterdam, pp 445–522.

    Google Scholar 

  • Potts CN and Van Wassenhove LN (1992). Integrating scheduling with batching and lot sizing: a review of algorithms and complexity. J Opl Res Soc 43: 395–406.

    Article  Google Scholar 

  • Rios-Mercado RZ and Bard JF (1998). Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput Opns Res 25: 351–366.

    Article  Google Scholar 

  • Rios-Mercado RZ and Bard JF (1999). A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Trans 31: 721–731.

    Google Scholar 

  • Ruiz R, Maroto C and Alcaraz J (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheurisics. Eur J Opl Res 165: 34–54.

    Article  Google Scholar 

  • Tseng FT and Stafford EF (2001). Two MILP models for the NxM SDST flowshop sequencing problem. Int J Prod Res 9: 1777–1809.

    Article  Google Scholar 

  • Yang WH and Liao CJ (1999). Survey of scheduling research involving setup times. Int J Sys Sci 30: 143–155.

    Article  Google Scholar 

Download references

Acknowledgements

Constructive comments from two anonymous reviewers and the Co-editor, John Wilson, improved the presentation of this paper.

Author information

Authors and Affiliations

  1. The University of Alabama in Huntsville, Huntsville, AL, USA

    F T Tseng, J N D Gupta & E F Stafford Jr

Authors
  1. F T Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J N D Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E F Stafford Jr
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F T Tseng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseng, F., Gupta, J. & Stafford, E. A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times. J Oper Res Soc 57, 541–551 (2006). https://doi.org/10.1057/palgrave.jors.2602020

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602020

Keywords

Search

Navigation