A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time

[1]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[2]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

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

[4]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[5]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[6]  Ching-Jong Liao,et al.  A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..

[7]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[8]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[9]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[10]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

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

[12]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[13]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[14]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[15]  Peter B. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1998, Ann. Oper. Res..

[16]  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..

[17]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..