Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization

[1]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

[2]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[3]  Xiaoping Li,et al.  Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion , 2010, Eur. J. Oper. Res..

[4]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[5]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[6]  A. Allahverdi,et al.  New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .

[7]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[8]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[9]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[10]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[11]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[12]  R. Tavakkoli-Moghaddam,et al.  Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm , 2008 .

[13]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[14]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[15]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[16]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[17]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[18]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[19]  Ali Allahverdi,et al.  Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times , 2001, J. Oper. Res. Soc..

[20]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[21]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

[22]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[23]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

[24]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[25]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

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

[27]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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