Integrated Iterated Local Search for the Permutation Flowshop Problem with Tardiness Minimization
暂无分享,去创建一个
[1] Thomas Sttzle,et al. Applying iterated local search to the permutation ow shop problem , 1998 .
[2] Chandrasekharan Rajendran,et al. Scheduling in flowshops to minimize total tardiness of jobs , 2004 .
[3] Ömer Kirca,et al. A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..
[4] Rubén Ruiz,et al. Cooperative metaheuristics for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..
[5] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[6] Rubén Ruiz,et al. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .
[7] Yeong-Dae Kim,et al. Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .
[8] Tapan Sen,et al. A state-of-art survey of static scheduling research involving due dates , 1984 .
[9] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[10] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.
[11] Peng Si Ow,et al. Focused Scheduling in Proportionate Flowshops , 1985 .
[12] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[13] Godfrey C. Onwubolu,et al. Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .
[14] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[15] Débora P. Ronconi,et al. Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..
[16] A. Hertz,et al. A new heuristic method for the flow shop sequencing problem , 1989 .
[17] 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..
[18] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[19] Yeong-Dae Kim,et al. Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .
[20] B. Adenso-Díaz. Restricted neighborhood in the tabu search for the flowshop problem , 1992 .