Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

Computers and Industrial Engineering

Volumn 60, Issue 4, 2011, Pages 706-718

  Zhang, Yi ^a,b   Li, Xiaoping ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

Author keywords

Estimation of distribution algorithm; Meta heuristic; Permutation flow shops; Total flowtime

Indexed keywords

EFFECTIVE VARIABLES; ESTIMATION OF DISTRIBUTION ALGORITHMS; LONGEST COMMON SUBSEQUENCES; META-HEURISTIC; PERMUTATION FLOW SHOPS; POPULATION DIVERSITY; PROBABILITY DISTRIBUTION MODEL; TOTAL FLOWTIME;

ALGORITHMS; ESTIMATION; GENES; HEURISTIC METHODS; MACHINE SHOP PRACTICE;

PROBABILITY DISTRIBUTIONS;

EID: 79952618751     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.01.005     Document Type: Article

References (46)

1. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics. 77 2002 71 83 (Pubitemid 34284488)
2. Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Carnegie Mellon University, Technical Report.
3. S. Baluja, and S. Davies Fast probability distribution modeling for combinatorial optimization Proceedings of the National Conference on Artificial Intelligence 1998 469 476
4. R. Blanco, P. Larranaga, and I. Inza Gene selection for cancer classification using wrapper approaches International Journal of Pattern Recognition and Artificial Intelligence 18 2004 1373 1390 (Pubitemid 40068693)
5. P.A.N. Bosman, and D. Thierens Advancing continuous IDEA's with mixture distributions and factorization selection metrics Proceedings, Genetic and Evolutionary Computation Conference 2001 208 212
6. R.M. Cesar, E. Bengoetxea, I. Bloch, and P. Larrangaga Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms Pattern Recognition 38 2005 2099 2113 (Pubitemid 41214647)
7. P.C. Chang, S.H. Chen, and C.H. Liu Sub-population genetic algorithm with mining gene structures for multi-objective flowshop scheduling problems Expert Systems with Applications 33 2007 762 771
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to algorithms 2nd ed. 2006 MIT Press Cambridge, MA
9. J.S.I. De Bonet, and P. Viola MIMIC: Finding optima by estimating probability densities Advances in Neural Information Processing Systems 9 1997 424 431
10. X. Dong, H. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers & Operations Research 36 2009 1664 1669
11. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimisation in permutation flowshops OMEGA 31 2003 311 317 (Pubitemid 36742549)
12. J.M. Framinan, R. Leisten, and R. Ruiz Comparison of heuristics for flowtime minimisation in permutation flowshops Computers & Operations Research 32 2005 1237 1254
13. S. French Sequencing and scheduling: an introduction to the mathematics of the job-shop 1982 Ellis Horwood Chichester
14. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
15. M. Hohfeld, and G. Rudolph Towards a theory of population based incremental learning Proceedings of the International Conference on Evolutionary Computation 1997 1 5
16. P. Inza, P. Larranaga, and B.S. Etxeberria Feature subset selection by Bayesian network-based optimization Artificial Intelligence 123 2000 157 184
17. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 2009 2638 2646
18. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers & Industrial Engineering 54 2008 526 538 (Pubitemid 351199803)
19. S.M. Johnson Optimal two-and-three-state production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
20. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flowshops OMEGA 37 2009 155 164
21. i scheduling problem European Journal of Operational Research 132 2001 439 452 (Pubitemid 32385032)
22. V.V. Miagkikh, and W.F. Punch Global search in combinatorial optimization using reinforcement learning algorithms Proceedings of the International Conference on Evolutionary Computation 1999 189 196
23. D.C. Montgomery Design and analysis of experiments 5th ed. 2000 Wiley New York
24. H. Mühlenbein The equation for response to selection and its use for prediction Evolutionary Computation 5 1998 303 346
25. M. Nawaz, E.E. Enscore, and I. Ham A heuristic algorithm for the m-machine n-job flow-shop sequencing problem OMEGA 11 1983 91 95 (Pubitemid 13193807)
26. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 2008 795 816
27. M. Pelikan, D.E. Goldberg, and E. Cantu BOA: The Bayesian optimization algorithm Proceedings, Genetic and Evolutionary Computation Conference 1999 525 532
28. C. Rajendran A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria International Journal of Production Research 32 1994 2541 2558
29. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1997 129 138 (Pubitemid 127396735)
30. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan-total flowtime of jobs European Journal of Operation Research 115 2004 426 438
31. C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Computers & Industrial Engineering 48 2005 789 797 (Pubitemid 40391497)
32. R. Ruiz, C. Maroto, and J. Alcaraz Two new robust genetic algorithms for the flowshop scheduling problem OMEGA 34 2006 461 476 (Pubitemid 43046058)
33. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 2007 2033 2049 (Pubitemid 44712036)
34. R. Ruiz, and T. Stützle An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives European Journal of Operational Research 187 2008 1143 1159 (Pubitemid 350245722)
35. R. Sagarna, and J. Lozano On the performance of estimation of distribution algorithms applied to software testing Applied Artificial Intelligence 19 2005 457 489 (Pubitemid 40584358)
36. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285 (Pubitemid 23599340)
37. M.F. Tasgetiren, Y.C. 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 2007 1930 1947 (Pubitemid 44780934)
38. L.Y. Tseng, and Y.T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 198 2009 84 92
39. V.S. Vempati, C.L. Chen, and S.F. Bulllngton An effective heuristic for flow shop problems with total flow time as criterion Computers & Industrial Engineering 25 1993 219 222
40. D.S. Woo, and H.S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers & Operations Research 25 1998 175 182
41. B.T. Zhang A Bayesian framework for evolutionary computation Proceedings of the International Conference on Evolutionary Computation 1999 722 728
42. Q. Zhang, and H. Mühlenbein On the convergence of a class of estimation of distribution algorithms IEEE Transactions on Evolutionary Computation 8 2004 127 135
43. Q. Zhang, J. Sun, and E. Tsang An evolutionary algorithm with guided mutation for the maximum clique problem IEEE Transactions on Evolutionary Computation 9 2005 192 200 (Pubitemid 40564736)
44. Q. Zhang, J. Sun, E.P.K. Tsang, and J. Ford Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem Proceedings, Genetic and Evolutionary Computation Conference 2004 42 48
45. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 2009 869 876
46. Zhu, K. Q. (2003). Population diversity in genetic algorithm for vehicle routing problem with time windows. National University of Singapore, Technical Report.