On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 571-578

  Gunia, Christian ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Algorithms; Evolution; Scheduling; Theory

Indexed keywords

HEURISTIC METHODS; PROGRAM PROCESSORS; SCHEDULING;

CPU-POWER; PROBLEM-SPECIFIC ALGORITHM; SEARCH HEURISTICS;

EVOLUTIONARY ALGORITHMS;

EID: 32444438181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068106     Document Type: Conference Paper

References (15)

1. T. Baeck, D. Fogel, and Z. Michalewicz. Handbook of Evolutionary Computation. Institute of Physics Publishing, 1997.
2. H. David and H. Nagaraja. Order Statistics, 3rd edition. Wiley, 2003.
3. S. Droste, T. Jansen, and I. Wegener. On the Analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276:51-81, 2002.
4. J. Frenk and A. Rinnooy Kan. The Rate of Convergence to Optimality of the LPT Rule. In Discrete Applied Mathematics, volume 14, pages 187-197. 1986.
5. M. Garey and D, Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
6. O. Giel and I. Wegener. Evolutionary Algorithms and the Maximum Matching Problem, In Proceedings of 20th STACS number 2607 in LNCS, pages 415-426, 2003.
7. R. Graham. Bounds for Certain Multiprocessing Anomalies. In Bell System Technical Journal, number 45, pages 1563-1581. 1966.
8. D. Hochbaum and D. Shmoys. Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results. In Journal of the Association for Computing Machinery, number 34 (1), pages 144-162. 1987.
9. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by Simulated Annealing. In Science, volume 220, 4598, pages 671-680. 1983.
10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. F. Neumann and I. Wegener. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. In Proc. of GECCO, LNCS, volume 3102, pages 713-724. 2004.
12. S. Sahni. Algorithms for Scheduling Independent Tasks. In Journal of the Association for Computing Machinery, number 23 (1), pages 116-127. 1976.
13. V. Vazirani. Approximation Algorithms, Corrected Second Printing. Springer, 2003.
14. I. Wegener. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions. In R. Sarker, X. Yao, M. Mohammadian, editor, Evolutionary Optimization, pages 349-369. Kluwer, 2002.
15. C. Witt. Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. In Proceedings of STACS, volume 3404 of LNCS, pages 44-56, 2005.