An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems
暂无分享,去创建一个
Abdelwaheb Rebai | Bassem Jarboui | Patrick Siarry | Mansour Eddaly | P. Siarry | B. Jarboui | A. Rebai | M. Eddaly
[1] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[2] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[3] Thomas Bäck,et al. Evolutionary Algorithms in Theory and Practice , 1996 .
[4] David B. Fogel,et al. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence (IEEE Press Series on Computational Intelligence) , 2006 .
[5] 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).
[6] Qingfu Zhang,et al. Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem , 2006, Towards a New Evolutionary Computation.
[7] Débora P. Ronconi,et al. A note on constructive heuristics for the flowshop problem with blocking , 2004 .
[8] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[9] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[10] Jose A. Lozano,et al. Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research , 2002, Estimation of Distribution Algorithms.
[11] J. Grabowski,et al. The permutation flow shop problem with blocking. A tabu search approach , 2007 .
[12] David E. Goldberg,et al. Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.
[13] Pedro Larrañaga,et al. Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.
[14] Gilbert Syswerda,et al. Simulated Crossover in Genetic Algorithms , 1992, FOGA.
[15] Rajkumar Roy,et al. Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .
[16] Tapan P. Bagchi,et al. Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .
[17] Richard S. H. Mah,et al. An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .
[18] M. Pelikán,et al. The Bivariate Marginal Distribution Algorithm , 1999 .
[19] Pedro Larrañaga,et al. Combinatonal Optimization by Learning and Simulation of Bayesian Networks , 2000, UAI.
[20] Débora P. Ronconi,et al. Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..
[21] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[22] J. A. Lozano,et al. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .
[23] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[24] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[25] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.
[26] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[27] Qingfu Zhang,et al. This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of , 2022 .
[28] Hitoshi Iba,et al. Linear and Combinatorial Optimizations by Estimation of Distribution Algorithms , 2002 .
[29] Chelliah Sriskandarajah,et al. Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..
[30] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[31] Débora P. Ronconi,et al. A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..
[32] Pedro Larrañaga,et al. Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.
[33] Qingfu Zhang,et al. Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem , 2004, EvoCOP.
[34] Manuel Mateo,et al. Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems , 2007, Comput. Oper. Res..
[35] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[36] Qingfu Zhang,et al. An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem , 2007, GECCO '07.
[37] H. Muhlenbein,et al. The Factorized Distribution Algorithm for additively decomposed functions , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[38] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[39] S. Baluja,et al. Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .