Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem

[1]  Manuel Laguna,et al.  Tabu Search , 1997 .

[2]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[3]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[4]  Ramón Alvarez-Valdés,et al.  GRASP and path relinking for project scheduling under partially renewable resources , 2008, Eur. J. Oper. Res..

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

[6]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[7]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .

[8]  Rubén Ruiz,et al.  No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .

[9]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[10]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

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

[12]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

[13]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[14]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[15]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[16]  Kin Keung Lai,et al.  Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem , 2006, Eur. J. Oper. Res..

[17]  Jeng-Fung Chen,et al.  Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints , 2006 .

[18]  Jeffrey E. Schaller,et al.  Note on minimizing total tardiness in a two-machine flowshop , 2005, Comput. Oper. Res..

[19]  Marco Chiarandini,et al.  Stochastic local search methods for highly constrained combinatorial optimisation problems: graph colouring, generalisations, and applications , 2005 .

[20]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[21]  El-Ghazali Talbi,et al.  Path Relinking in Pareto Multi-objective Genetic Algorithms , 2005, EMO.

[22]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[23]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[24]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[25]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..

[26]  Chandrasekharan Rajendran,et al.  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times , 2003, Eur. J. Oper. Res..

[27]  Mark Wineberg,et al.  The Underlying Similarity of Diversity Measures Used in Evolutionary Computation , 2003, GECCO.

[28]  Jen-Shiang Chen,et al.  Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..

[29]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[30]  Godfrey C. Onwubolu,et al.  Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .

[31]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[32]  C. Rajendran,et al.  Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell , 1998 .

[33]  C. Reeves,et al.  Genetic Algorithms, Path Relinking, the Flowshop Sequencing Problem and , 1998 .

[34]  Chandrasekharan Rajendran,et al.  An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs , 1997 .

[35]  Jason Chao-Hsien Pan,et al.  Two-machine flowshop scheduling to minimize total tardiness , 1997, Int. J. Syst. Sci..

[36]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

[37]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[38]  Yeong-Dae Kim,et al.  Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .

[39]  Belarmino Adenso-Díaz,et al.  An SA/TS mixture algorithm for the scheduling tardiness problem , 1996 .

[40]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[41]  Narayan Raman,et al.  Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches , 1995 .

[42]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[43]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[45]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[46]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[47]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[48]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[49]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[50]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[51]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[52]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

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

[54]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[55]  Eitan Zemel.  Measuring the Quality of Approximate Solutions to Zero-One Programming Problems , 1981, Math. Oper. Res..

[56]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[57]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[58]  M. F. Fuller,et al.  Practical Nonparametric Statistics; Nonparametric Statistical Inference , 1973 .

[59]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[60]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[61]  M. Friedman.  The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .