Multi-objective no-wait flowshop scheduling problems: models and algorithms
暂无分享,去创建一个
B. Naderi | M. Aminnayeri | M. Aminnayeri | B. Naderi | M. Piri | M.H. Ha'iri Yazdi | M. Piri | M.H. Ha'iri Yazdi
[1] Alireza Rahimi-Vahed,et al. A multi-objective particle swarm for a flow shop scheduling problem , 2006, J. Comb. Optim..
[2] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[3] Hans Röck,et al. Some new results in flow shop scheduling , 1984, Z. Oper. Research.
[4] Jeffrey E. Schaller,et al. Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties , 2010 .
[5] S. K. Goyal. Job-shop sequencing problem with no wait in process , 1975 .
[6] Xueping Li,et al. Restricted job completion time variance minimisation on identical parallel machines , 2009 .
[7] C. Rajendran,et al. Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .
[8] G. Liesegang,et al. Comment on “On the Flow-Shop Sequencing Problem with No Wait in Process” , 1972 .
[9] Quan-Ke Pan,et al. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .
[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] Chuen-Lung Chen,et al. Genetic algorithms applied to the continuous flow shop problem , 1996 .
[12] J. Gupta. Optimal flowshop schedules with no intermediate storage space , 1976 .
[13] Karen A. F. Copeland. Design and Analysis of Experiments, 5th Ed. , 2001 .
[14] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[15] Tariq A. Aldowaisan,et al. NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .
[16] Harvey M. Wagner,et al. An integer linear‐programming model for machine scheduling , 1959 .
[17] Chao-Hsien Pan,et al. A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..
[18] Peter Brucker,et al. Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.
[19] H. Zimmermann. Fuzzy programming and linear programming with several objective functions , 1978 .
[20] Józef Grabowski,et al. Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..
[21] Marco Laumanns,et al. Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..
[22] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[23] Margaret J. Robertson,et al. Design and Analysis of Experiments , 2006, Handbook of statistics.
[24] Christer Carlsson,et al. Fuzzy multiple criteria decision making: Recent developments , 1996, Fuzzy Sets Syst..
[25] Rubén Ruiz,et al. The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..
[26] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[27] P. Lopez,et al. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems , 2007 .
[28] Marie E. Matta. A genetic algorithm for the proportionate multiprocessor open shop , 2009, Comput. Oper. Res..
[29] Xiaoping Li,et al. Heuristic for no-wait flow shops with makespan minimization , 2008, ICIT 2008.
[30] Quan-Ke Pan,et al. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .
[31] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[32] Rubén Ruiz,et al. A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..
[33] Stefan Voß,et al. Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..
[34] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[35] Han Hoogeveen,et al. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..
[36] Ping Chen,et al. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..
[37] Lothar Thiele,et al. A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .
[38] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .
[39] Bertrand M. T. Lin,et al. Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..
[40] Jose M. Framiñan,et al. Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..
[41] Martin Josef Geiger,et al. On operators and search space topology in multi-objective flow shop scheduling , 2007, Eur. J. Oper. Res..
[42] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[43] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[44] Mostafa Zandieh,et al. Algorithms for a realistic variant of flowshop scheduling , 2010, Comput. Oper. Res..
[45] D. Chaudhuri,et al. Heuristic algorithms for continuous flow-shop problem , 1990 .
[46] Xiaoyun Xu,et al. Influencing factors of job waiting time variance on a single machine , 2007 .
[47] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[48] Reza Tavakkoli-Moghaddam,et al. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..
[49] Chandrasekharan Rajendran,et al. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..
[50] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[51] D. A. Wismer,et al. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..