A Self-guided Genetic Algorithm for permutation flowshop scheduling problems

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1450-1457

  Chen, Shih Hsin ^a   Chang, Pei Chann ^b   Cheng, T C E ^c   Zhang, Qingfu ^d  

^a NANHUA UNIVERSITY   (Taiwan)

^b YUAN ZE UNIVERSITY   (Taiwan)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^d UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Estimation of Distribution Algorithms; Permutation flowshop scheduling; Self guided crossover; Self guided mutation

Indexed keywords

COMBINATORIAL PROBLEM; CROSSOVER AND MUTATION; CROSSOVER OPERATIONS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTION PROCESS; FLOW SHOP SCHEDULING PROBLEM; GENETIC OPERATORS; LOCATION INFORMATION; MAKESPAN; NEW SOLUTIONS; NOVEL STRATEGIES; NP COMPLETE; PERMUTATION FLOW-SHOP SCHEDULING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PROBABILISTIC MODELS; SELF-GUIDED CROSSOVER; SELF-GUIDED MUTATION; STATISTICAL INFORMATION;

ESTIMATION; INFORMATION USE; SCHEDULING ALGORITHMS; STATISTICS;

GENETIC ALGORITHMS;

EID: 81555204454     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.08.016     Document Type: Article

References (44)

1. R. Baraglia, J. Hidalgo, and R. Perego A hybrid heuristic for the traveling salesman problem IEEE Transactions on Evolutionary Computation 5 6 2001 613 622 (Pubitemid 34091919)
2. G. Harik, F. Lobo, and D. Goldberg The compact genetic algorithm IEEE Transactions on Evolutionary Computation 3 4 1999 287 297
3. H. Muhlenbein, and G. Paaß From recombination of genes to the estimation of distributions I. Binary parameters Lecture Notes in Computer Science vol. 1141 1996 178 187 (Pubitemid 126128306)
4. M. Pelikan, D.E. Goldberg, and F.G. Lobo A survey of optimization by building and using probabilistic models Computational Optimization and Applications 21 1 2002 5 20 (Pubitemid 34172679)
5. Q. Zhang, J. Sun, and E. Tsang An evolutionary algorithm with guided mutation for the maximum clique problem IEEE Transactions on Evolutionary Computation 9 2 2005 192 200 (Pubitemid 40564736)
6. P.C. Chang, S.H. Chen, and C.Y. Fan Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems Applied Soft Computing Journal 8 1 2008 767 777
7. J. Pena, V. Robles, P. Larranaga, V. Herves, F. Rosales, and M. Perez Ga-eda: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms B. Orchard, C. Yang, M. Ali, Innovations in applied artificial intelligence, Lecture notes in computer science vol. 3029 2004 Springer Berlin/Heidelberg 361 371 (Pubitemid 38761241)
8. C. Lima, M. Pelikan, F. Lobo, and D. Goldberg Loopy substructural local search for the Bayesian optimization algorithm, engineering stochastic local search algorithms Designing, Implementing and Analyzing Effective Heuristics 2009 61 75
9. F. Glover, and G. Kochenberger Critical event tabu search for multidimensional knapsack problems 1996 Kluwer Academic Publishers p. 40727
10. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling-salesman problem Operations Research 21 2 1973 498 516
11. S.H. Chen, P.C. Chang, Q. Zhang, and C.B. Wang A guided memetic algorithm with probabilistic models International Journal of Innovative Computing, Information and Control 5 12 2009 4753 4764
12. A.E.I. Brownlee, J.A.W. McCall, Q. Zhang, and D.F. Brown Approaches to selection and their effect on fitness modelling in an estimation of distribution algorithm IEEE congress on evolutionary computation, 2008. CEC 2008 2008 IEEE 2621 2628
13. K. Sastry, M. Pelikan, and D. Goldberg Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation Congress on evolutionary computation, 2004 vol. 1 2004 IEEE 720 727
14. K. Sastry, M. Pelikan, and D. Goldberg Efficiency enhancement of estimation of distribution algorithms Computational Intelligence 33 2006 161 185
15. I. Kacem, S. Hammadi, and P. Borne Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic Mathematics and Computers in Simulation 60 35 2002 245 276
16. J.M. Framinan, J.N.D. Gupta, and R. Leisten A review and classification of heuristics for permutation flow-shop scheduling with makespan objective Journal of the Operational Research Society 55 12 2004 1243 1255
17. S. Hejazi, and S. Saghafian Flowshop-scheduling problems with makespan criterion: a review International Journal of Production Research 43 14 2005 2895 2929 (Pubitemid 41657440)
18. C.L. Chen, V.S. Vempati, and N. Aljaber An application of genetic algorithms for flow shop problems European Journal of Operational Research 80 2 1995 389 396
19. C.R. Reeves A genetic algorithm for flowshop sequencing Computers and Operations Research 22 1 1995 5 13
20. P. Chang, S.H. Chen, and C.Y. Fan Generating artificial chromosomes by mining gene structures with diversity preservation for scheduling problems Annals of Operations Research 180 1 2010 197 211
21. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers and Operations Research 36 9 2009 2638 2646
22. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multiobjective algorithms for the flowshop scheduling problem INFORMS Journal on Computing 20 3 2008 451 471
23. K.R. Baker Introduction to sequencing and scheduling 1974 Wiley
24. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494 (Pubitemid 40206377)
25. P.C. Chang, S.H. Chen, and V. Mani A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties Applied Mathematical Modeling 33 1 2009 579 596
26. S. Baluja Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning 1994 Carnegie Mellon University Pittsburgh PA, USA
27. Baluja S. An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95-193, Carnegie Mellon University; 1995.
28. Q. Zhang, and H. Muhlenbein On the convergence of a class of estimation of distribution algorithms IEEE Transactions on Evolutionary Computation 8 2 2004 127 136
29. S. Baluja, and S. Davies Fast probabilistic modeling for combinatorial optimization Proceedings of the fifteenth national/tenth conference on artificial intelligence 1998 John Wiley & Sons Inc. 469 476
30. S. Baluja, and S. Davies Using optimal dependency-trees for combinational optimization Proceedings of the fourteenth international conference on machine learning table of contents 1997 30 38
31. M. Pelikan, D.E. Goldberg, and E. Cantu-Paz BOA: the Bayesian optimization algorithm Proceedings of the genetic and evolutionary computation conference GECCO-99 vol. 1 1999 525 532
32. U. Aickelin, E.K. Burke, and J. Li An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering Journal of the Operational Research Society 58 12 2007 1574 1585 (Pubitemid 350129146)
33. I. Good The estimation of probabilities: an essay on modern Bayesian methods 2003 The MIT Press
34. J. Han, and M. Kamber Data mining: concepts and techniques 2006 Morgan Kaufmann
35. B. Cestnik Estimating probabilities: a crucial task in machine learning Proceedings of the ninth european conference on artificial intelligence 1990 147 149
36. Murata T, Ishibuchi H. Performance evaluation of genetic algorithms for flowshop scheduling problems 1994; 8127.
37. E. Taillard Benchmarks for basic scheduling instances European Journal of Operational Research 64 1993 278 285
38. P.C. Chang, S.H. Chen, and C.Y. Fan Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems Applied Mathematics and Computation 205 2 2008 550 561
39. M. Tasgetiren, Y. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947 (Pubitemid 44780934)
40. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers & Industrial Engineering 54 3 2008 526 538 (Pubitemid 351199803)
41. Q. Pan, M. Tasgetiren, and Y. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 4 2008 795 816
42. M. Nawaz, E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem OMEGA 11 1 1983 91 95 (Pubitemid 13193807)
43. D. Montgomery Design and analysis of experiments 2008 John Wiley & Sons Inc.
44. A. Eiben, and M. Schut New ways to calibrate evolutionary algorithms P. Siarry, Z. Michalewicz, Advances in metaheuristics for hard optimization, natural computing series 2008 Springer 153 177