NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
暂无分享,去创建一个
[1] Yeong-Dae Kim,et al. Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates , 2001, IEEE Trans. Robotics Autom..
[2] L. Gelders,et al. Four simple heuristics for scheduling a flow-shop , 1978 .
[3] 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..
[4] Chandrasekharan Rajendran,et al. Scheduling in flowshops to minimize total tardiness of jobs , 2004 .
[5] Jerzy Kamburowski,et al. An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..
[6] Xavier Tort-Martorell,et al. Comparing three-step heuristics for the permutation flow shop problem , 2010, Comput. Oper. Res..
[7] Yeong-Dae Kim,et al. Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .
[8] S. S. Panwalkar,et al. Sequencing Research and the Industrial Scheduling Problem , 1973 .
[9] J. Kamburowski,et al. On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .
[10] J. Schaller. Scheduling a permutation flow shop with family setups to minimise total tardiness , 2012 .
[11] Shaukat A. Brah,et al. Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..
[12] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[13] Victor Fernandez-Viagas,et al. On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..
[14] Rubén Ruiz,et al. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .
[15] Rainer Leisten,et al. Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm , 2008 .
[16] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[17] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[18] Chris N. Potts,et al. A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..
[19] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[20] Ping Chen,et al. An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..
[21] Jose M. Framiñan,et al. Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .
[22] C. Rajendran,et al. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .
[23] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..
[24] Jerzy Kamburowski,et al. On Recent Modifications And Extensions Of The Neh Heuristic For Flow Shop Sequencing , 2011 .
[25] 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..
[26] Narayan Raman,et al. Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches , 1995 .
[27] Jerzy Kamburowski,et al. An empirical analysis of the optimality rate of flow shop heuristics , 2009, Eur. J. Oper. Res..
[28] Quan-Ke Pan,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[29] Yeong-Dae Kim,et al. Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .
[30] Tapan Sen,et al. A state-of-art survey of static scheduling research involving due dates , 1984 .
[31] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[32] 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..