Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems

Expert Systems with Applications

Volumn 37, Issue 9, 2010, Pages 6441-6451

  Chen, Shih Hsin ^a   Chen, Min Chih ^b   Chang, Pei Chann ^c   Zhang, Qingfu ^d   Chen, Yuh Min ^b  

^a NANHUA UNIVERSITY   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^c YUAN ZE UNIVERSITY   (Taiwan)

^d UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Diversification; Estimation of distribution algorithms; Intensification; Just in time; Single machine scheduling problems

Indexed keywords

EVOLUTIONARY ALGORITHMS; JUST IN TIME PRODUCTION; MACHINERY; SCHEDULING;

DIVERSIFICATION; ESTIMATION OF DISTRIBUTION ALGORITHMS; INTENSIFICATION; JUST IN TIME; SINGLE MACHINE SCHEDULING PROBLEMS;

SCHEDULING ALGORITHMS;

EID: 79960565348     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.02.073     Document Type: Article

References (64)

1. Abdul-Razaq, T., & Potts, C. (1988). Dynamic programming state-space relaxation for single-machine scheduling. The Journal of the Operational Research Society, 39(2), 141-152. (Pubitemid 18591995)
2. Ackley, D. H. (1987). A connectionist machine for genetic hillclimbing. Norwell, MA, USA: Kluwer Academic Publishers.
3. Aickelin, U., Burke, E. K., & Li, J. (2007). An Estimation of Distribution Algorithm with intelligent local search for rule-based nurse rostering. Journal of the Operational Research Society, 58(12), 1574-1585. (Pubitemid 350129146)
4. Alves, M. J., & Almeida, M. (2007). MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Computers and Operations Research, 34(11), 3458-3470. (Pubitemid 46533881)
5. Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report No. CMU-CS-94-163. Pittsburgh, PA: Carnegie Mellon University.
6. Baluja, S. (1995). An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical Report No. CMU-CS-95-193. Carnegie Mellon University.
7. Baluja, S., & Davies, S. (1997). Using optimal dependency-trees for combinational optimization. In Proceedings of the fourteenth international conference on machine learning (table of contents) (pp. 30-38).
8. Baluja, S., & Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In Proceedings of the fifteenth national/tenth conference on artificial intelligence/innovative applications of artificial intelligence (table of contents) (pp. 469-476).
9. Baraglia, R., Hidalgo, J., Perego, R., Cnuce, I., & Cnr, P. (2001). A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 5(6), 613-622. (Pubitemid 34091919)
10. Battiti, R., & Tecchiolli, G. (1994). The reactive tabu search. ORSA Journal on Computing, 6(2), 126-140.
11. Belouadah, H., Posner, M., & Potts, C. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36(3), 213-231.
12. Birbil, S., & Fang, S. C. (2003). An electromagnetism-like mechanism for global optimization. Journal of Global Optimization, 25(3), 263-282.
13. Chang, P. C. (1999). A branch and bound approach for single machine scheduling with earliness and tardiness penalties. Computers and Mathematics with Applications, 37(10), 133-144.
14. Chang, P. C., Chen, S. H., & Fan, C. Y. (2009c). A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Systems with Applications, 36(2, Part 1), 1259-1267.
15. Chang, P. C., Chen, S. H., & Liu, C. H. (2007). Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Systems with Applications, 33(3), 762-771.
16. Chang, P. C., Chen, S. H., & Mani, V. (2009d). A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties. Applied Mathematical Modeling, 33(1), 579-596.
17. Chang, P., Chen, S. H., & Fan, C. Y. (2009a). Generating artificial chromosomes by mining gene structures with diversity preservation for scheduling problems. Annals of Operations Research.
18. Chang, P., Hsieh, J., Chen, S., Lin, J., & Huang, W. (2009b). Artificial chromosomes embedded in genetic algorithm for a chip resistor scheduling problem in minimizing the makespan. Expert Systems with Applications, 36(3, Part 2), 7135-7141.
19. Chang, P. C., & Lee, H. C. (1992). A greedy heuristic for bicriterion single machine scheduling problems. Computers and Industrial Engineering, 22(2), 121-131.
20. Chen, S. H., & Chen, M. C. (2009). Convergency analysis of some Estimation of Distribution Algorithms in detail (pp. 1-7). Technical Report (1).
21. Chen, S. H., Chang, P. C., & Zhang, Q. (2008b). Self-guided genetic algorithm. Lecture Notes in Artificial Intelligence, 5227, 292-299.
22. Chen, S. H., Chang, P. C., Chen, M. C., Chen, & Y. M. (2008a). Domininance properties for self-guided GA in solving the single machine scheduling problems. In Proceedings of the CI-Sched 2009 (Vol. 5227, pp. 292-299).
23. Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., et al. (1999). New ideas in optimization. UK Maidenhead, UK, England: McGraw-Hill Ltd.
24. Eiben, A., & Smith, J. (2003). Introduction to evolutionary computing. Springer.
25. Gambardella, L., Taillard, E., & Dorigo, M. (1999). Ant colonies for the QAP. Journal of the Operational Research Society, 50(2), 167-176.
26. Glover, F., & Laguna, M. (1998). Tabu search. Norwell, MA, USA: Kluwer Academic Publishers.
27. Hansen, P., & Mladenović , N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449-467. (Pubitemid 32875304)
28. Hansen, P., Mladenović , N., & Perez-Britos, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7(4), 335-350. (Pubitemid 32693910)
29. Harik, G., Lobo, F., & Goldberg, D. (1999). The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3(4), 287-297.
30. Hofmeyr, S., & Forrest, S. (2000). Architecture for an artificial immune system. Evolutionary Computation, 8(4), 443-473.
31. Hunt, J., & Cooke, D. (1996). Learning using an artificial immune system. Journal of Network and Computer Applications, 19(2), 189-212. (Pubitemid 126412791)
32. Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184(3), 879-899. (Pubitemid 47391163)
33. Larrañaga, P., & Lozano, J. A. (2002). Estimation of Distribution Algorithms: A new tool for evolutionary computation. Kluwer Academic Publishers.
34. Lenstra, J., Kan, A., & Brucker, P. (1975). Complexity of machine scheduling problems. In Proc. workshop studies in integer programming, Bonn.
35. Li, G. (1997). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96(3), 546-558. (Pubitemid 127378187)
36. Liaw, C. F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers and Operations Research, 26(7), 679-693.
37. Lin, S., & Kernighan, B. (1973). An effective heuristic algorithm for the travelingsalesman problem. Operations Research, 21(2), 498-516.
38. Lozano, J. A. (2006). Towards a new evolutionary computation: Advances in the Estimation of Distribution Algorithms. Springer.
39. Luo, X., & Chu, F. (2006). A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Applied Mathematics and Computation, 183(1), 575-588. (Pubitemid 44908636)
40. Luo, X., Chu, C., & Wang, C. (2006). Some dominance properties for single-machine tardiness problems with sequence-dependent setup. International Journal of Production Research, 44(17), 3367-3378. (Pubitemid 43898307)
41. Miettinen, K. (1999). Nonlinear multiobjective optimization. Springer.
42. Montgomery, D. C. (2001). Design and analysis of experiments.
43. Muhlenbein, H. (1997). The equation for response to selection and its use for prediction. Evolutionary Computation, 5(3), 303-346. (Pubitemid 127718107)
44. Muhlenbein, H., & Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Lecture Notes in Computer Science, 1141, 178-187. (Pubitemid 126128306)
45. Nawaz, M., Enscore, E., & Ham, I. (1983). A heuristic algorithm for the m-machine, njob flow-shop sequencing problem. OMEGA, 11(1), 91-95. (Pubitemid 13193807)
46. Okabe, T., Jin, Y., Sendoff, B., & Olhofer, M. (2004). Voronoi-based Estimation of Distribution Algorithm for multi-objective optimization. In Congress on evolutionary computation CEC2004 (Vol. 2).
47. Osman, I., & Wassan, N. (2002). A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. Journal of Scheduling, 5(4), 263-285.
48. Ow, P. S., & Morton, T. E. (1989). The single machine early/tardy problem. Management Science, 35(2), 177-191.
49. Pasti, R., & de Castro, L. (2009). Bio-inspired and gradient-based algorithms to train MLPs: The influence of diversity. Information Sciences.
50. Pelikan, M., Goldberg, D. E., & Lobo, F. G. (2002). A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1), 5-20. (Pubitemid 34172679)
51. Peña, J., Robles, V., Larrañaga, P., Herves, V., Rosales, F., & Perez, M. (2004). GA-EDA: Hybrid evolutionary algorithm using genetic and Estimation of Distribution Algorithms. In Innovations in applied artificial intelligence: 17th international conference on industrial and engineering applications of artificial intelligence and expert systems. Proceedings of IEA/AIE 2004, Ottawa, Canada, May 17-20.
52. Santana, R., Larrañaga, P., & Lozano, J. (2008). Combining variable neighborhood search and Estimation of Distribution Algorithms in the protein side chain placement problem. Journal of Heuristics, 14, 519-547.
53. Sastry, K., Pelikan, M., & Goldberg, D. E. (2004). Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation. In Congress on evolutionary computation, CEC2004 (Vol. 1).
54. Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533-549.
55. Sourd, F., & Kedad-Sidhoum, S. (2007). A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, 1-10.
56. Syswerda, G. (1993). Simulated crossover in genetic algorithms. Foundations of Genetic Algorithms, 2, 239-255.
57. Valente, J. M. S., & Alves, R. A. F. S. (2005). Improved heuristics for the early/tardy scheduling problem with no idle time. Computers and Operations Research, 32(3), 557-569.
58. Valente, J. M. S., & Alves, R. A. F. S. (2007). Heuristics for the early/tardy scheduling problem with release dates. International Journal of Production Economics, 106(1), 261-274. (Pubitemid 44918296)
59. Wu, S. D., Storer, R. H., & Chang, P. C. (1993). One-machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research, 20(1), 1-14. (Pubitemid 23634781)
60. Zhang, Q., & Muhlenbein, H. (2004). On the convergence of a class of Estimation of Distribution Algorithms. IEEE Transactions on Evolutionary Computation, 8(2), 127-136.
61. Zhang, Q., Sun, J., & Tsang, E. (2005). An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Transactions on Evolutionary Computation, 9(2), 192-200. (Pubitemid 40564736)
62. Zhang, Q., Sun, J., & Tsang, E. (2007). Combinations of Estimation of Distribution Algorithms and other techniques. International Journal of Automation and Computing, 4(3), 273-280. (Pubitemid 47167354)
63. Zhang, J., & Szeto, K. Y. (2005). Mutation matrix in evolutionary computation: An application to resource allocation problem. Lecture Notes in Computer Science, 3612, 112-119. (Pubitemid 41449565)
64. Zhou, A., Zhang, Q., Jin, Y., Tsang, E., & Okabe, T. (2005). A model-based evolutionary algorithm for bi-objective optimization. In: Proceedings of the 2005 Congress on Evolutionary Computation CEC-2005 (pp. 2568-2575). Edinburgh: IEEE Press. (Pubitemid 41496170)