An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers
暂无分享,去创建一个
Bassem Jarboui | Patrick Siarry | Mansour Eddaly | Abdelwaheb Rebaï | P. Siarry | B. Jarboui | M. Eddaly | Abdelwaheb Rebaï
[1] Pedro Larrañaga,et al. Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.
[2] Dexian Huang,et al. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..
[3] Rajkumar Roy,et al. Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .
[4] Débora P. Ronconi,et al. A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..
[5] Eugeniusz Nowicki,et al. The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..
[6] M. Pelikán,et al. The Bivariate Marginal Distribution Algorithm , 1999 .
[7] Jacques Carlier,et al. Ordonnancements à contraintes disjonctives , 1978 .
[8] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[9] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[10] Bassem Jarboui,et al. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..
[11] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[12] Martin Pelikan,et al. Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).
[13] Sujit K. Dutta,et al. Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .
[14] Rubén Ruiz,et al. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .
[15] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[16] S. S. Reddi,et al. Note---Sequencing with Finite Intermediate Storage , 1976 .
[17] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.
[18] Mehmet Fatih Tasgetiren,et al. Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.
[19] D. Goldberg,et al. BOA: the Bayesian optimization algorithm , 1999 .
[20] Saul I. Gass,et al. Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..
[21] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[22] David E. Goldberg,et al. The compact genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[23] Ling Wang,et al. An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..
[24] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[25] J. A. Lozano,et al. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .
[26] Hans-Paul Schwefel,et al. Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.
[27] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[28] Heinz Mühlenbein,et al. FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.
[29] Pedro Larrañaga,et al. Combinatonal Optimization by Learning and Simulation of Bayesian Networks , 2000, UAI.