General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach

Abstract This paper proposes a new heuristic method for the general flowshop scheduling problem with the due dates and the sequence dependent setup times (SDSTs) where the objective is to minimize the total weighted tardiness. The approach consists of two phases: in the first phase, a permutation sequence is obtained and this sequence is then improved by a non-permutation local search in the next phase. Using some well-known standard benchmark problems, we examine the performance of the proposed algorithm and our computational results indicate that, despite its simplicity, the proposed heuristic approach provides better solutions than some other alternative methods.

[1]  Manojit Chattopadhyay,et al.  Meta-heuristics in cellular manufacturing: A state-of-the-art review , 2011 .

[2]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

[3]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[4]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[5]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[6]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[7]  Peter T. Cummings,et al.  Flowshop sequencing with non-permutation schedules , 1991 .

[8]  N. Anantharaman,et al.  Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems , 2003 .

[9]  Jatinder N. D. Gupta,et al.  A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times , 2006, J. Oper. Res. Soc..

[10]  Chou-Jung Hsu,et al.  Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect , 2012, Inf. Sci..

[11]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[12]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[13]  C. Liao,et al.  A performance evaluation of permutation vs. non-permutation schedules in a flowshop , 2006 .

[14]  Seyed Jafar Sadjadi,et al.  A state-of-art review on supplier selection problem , 2013 .

[15]  Reza Tavakkoli-Moghaddam,et al.  Solving a bi-objective flowshop scheduling problem by a Multi-objective Immune System and comparing with SPEA2+ and SPGA , 2011, Adv. Eng. Softw..

[16]  Jonathan F. Bard,et al.  Heuristics for the flow line problem with setup costs , 1998, Eur. J. Oper. Res..

[17]  Kuo-Ching Ying,et al.  Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic , 2008 .

[18]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[19]  Nasser Salmasi,et al.  Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..

[20]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[21]  Tamer Eren,et al.  A bicriteria m-machine flowshop scheduling with sequence-dependent setup times , 2010 .