EA/G-GA for single machine scheduling problems with earliness/tardiness costs

Entropy

Volumn 13, Issue 6, 2011, Pages 1152-1169

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

^a NANHUA UNIVERSITY   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^c YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Diversity; EA G; Estimation of Distribution Algorithms; Probability estimation; Single machine scheduling problems; Statistical learning problem

Indexed keywords

EID: 79960833764     PISSN: None     EISSN: 10994300     Source Type: Journal    
DOI: 10.3390/e13061152     Document Type: Article

References (38)

1. Chen, S.; Chen, M.; Chang, P.; Zhang, Q.; Chen, Y. Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Syst. Appl. 2010, 37, 6441-6451.
2. Aickelin, U.; Burke, E.K.; Li, J. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. Soc. 2007, 58, 1574-1585.
3. Harik, G.; Lobo, F.; Goldberg, D. The compact genetic algorithm. IEEE Trans. Evol. Comput. 1999, 3, 287-297.
4. Muhlenbein, H.; Paaß, G. From recombination of genes to the estimation of distributions I. Binary parameters. Lect. Notes Comput. Sci. 1996, 1141, 178-187.
5. Muelas, S.; Peña, J.; LaTorre, A.; Robles, V. A new initialization procedure for the distributed estimation of distribution algorithms. Soft Comput. 2010, 15, 713-720.
6. Zhang, Q.; Sun, J.; Tsang, E. An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 2005, 9, 192-200.
7. Pelikan, M.; Goldberg, D.E.; Lobo, F.G. A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 2002, 21, 5-20.
8. Friedman, C.; Huang, J.; Sandow, S. A utility-based approach to some information measures. Entropy 2007, 9, 1-26.
9. Santana, R.; Larrañaga, P.; Lozano, J. Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. J. Heuristics 2008, 14, 519-547.
10. Zhang, Q.; Muhlenbein, H. On the convergence of a class of estimation of distribution algorithms. IEEE Trans. Evol. Comput. 2004, 8, 127-136.
11. Peña, J.; Robles, V.; Larrañaga, P.; Herves, V.; Rosales, F.; Perez, M. GA-EDA: Hybrid Evolutionary Algorithm Using Genetic and Estimation of Distribution Algorithms. In Proceedings of the Innovations In Applied Artificial Intelligence: 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2004, Ottawa, Canada, 17-20 May 2004.
12. Zhou, A.; Zhang, Q.; Jin, Y.; Tsang, E.; Okabe, T. A Model-Based Evolutionary Algorithm for Bi-Objective Optimization. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, Edinburgh, UK, 2-4 September 2005; Volume 3, pp. 2568-2575.
13. Chang, P.C.; Chen, S.H.; Fan, C.Y. Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Appl. Soft Comput. 2008, 8, 767-777.
14. Chen, S.H.; Chang, P.C.; Zhang, Q. Self-guided genetic algorithm. Lect. Notes Artif. Intell. 2008, 5227, 292-299.
15. Peng, X.; Gao, X.; Yang, S. Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments. Soft Comput. 2011, 15, 311-326.
16. Chang, P.; Chen, S.H.; Fan, C.Y. Generating artificial chromosomes by mining gene structures with diversity preservation for scheduling problems. Ann. Oper. Res. 2010, 180, 197-211.
17. Lenstra, J.; Kan, A.; Brucker, P. Complexity of machine scheduling problems. Ann. Discrete Math. 1975, 1, 343-362.
18. Chang, P.C.; Lee, H.C. A greedy heuristic for bicriterion single machine scheduling problems. Comput. Ind. Eng. 1992, 22, 121-131.
19. Chang, P.C. A branch and bound approach for single machine scheduling with earliness and tardiness penalties. Comput. Math. Appl. 1999, 37, 133-144.
20. Wu, S.D.; Storer, R.H.; Chang, P.C. One-machine rescheduling heuristics with efficiency and stability as criteria. Comput. Oper. Res. 1993, 20, 1-14.
21. Belouadah, H.; Posner, M.; Potts, C. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Appl. Math. 1992, 36, 213-231.
22. Alves, M.J.; Almeida, M. MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 2007, 34, 3458-3470.
23. Valente, J.M.S.; Alves, R.A.F.S. Improved heuristics for the early/tardy scheduling problem with no idle time. Comput. Oper. Res. 2005, 32, 557-569.
24. Valente, J.M.S.; Alves, R.A.F.S. Heuristics for the early/tardy scheduling problem with release dates. Int. J. Prod. Econ. 2007, 106, 261-274.
25. Abdul-Razaq, T.; Potts, C. Dynamic programming State-space relaxation for single-machine scheduling. J. Oper. Res. Soc. 1988, 39, 141-152.
26. Li, G. Single machine earliness and tardiness scheduling. Eur. J. Oper. Res. 1997, 96, 546-558.
27. Liaw, C.F. A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput. Oper. Res. 1999, 26, 679-693.
28. Ow, P.S.; Morton, T.E. The Single Machine Early/Tardy Problem. Manage. Sci. 1989, 35, 177-191.
29. Chang, P.C.; Chen, S.H.; Fan, C.Y. A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Syst. Appl. 2009, 36, 1259-1267.
30. Birbil, Ş.; Fang, S.C. An Electromagnetism-like Mechanism for Global Optimization. J. Global Optim. 2003, 25, 263-282.
31. Chang, P.C.; Chen, S.H.; Liu, C.H. Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Syst. Appl. 2007, 33, 762-771.
32. Baluja, S.; Davies, S. Fast Probabilistic Modeling for Combinatorial Optimization. In Proceedings of the fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, Menlo Park, CA, USA, 1998; pp. 469-476.
33. Good, I. The Estimation of Probabilities: An Essay on Modern Bayesian Methods; The MIT Press: Cambridge, MA, USA, 1965.
34. Han, J.; Kamber,M. Data Mining: Concepts and Techniques; Morgan Kaufmann: Burlington, MA, USA, 2006.
35. Cestnik, B. Estimating Probabilities: A Crucial Task in Machine Learning. In Proceedings of the Ninth European Conference on Artificial Intelligence (ECAI-90), Stockholm, Sweden, 6-10 August 1990; pp. 147-149.
36. Muruta, T.; Ishibuchi, H. Performance Evolution of Genetic Algorithms for Flowshop Scheduling Problems. In Proceedings of First IEEE International Conference on Evolutionary Computation, Orlando, FL, USA, 27-29 June 1994.
37. Sourd, F.; Kedad-Sidhoum, S. The one-machine problem with earliness and tardiness penalties. J. Scheduling 2003, 6, 533-549.
38. Montgomery, D.C. Design and Analysis of Experiments, 5th, ed.; John Wiley: New York, NY, USA, 2001.