An investigation of hyper-heuristic search spaces

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 3776-3783

  Rodríguez, José Antonio Vázquez ^a   Petrovic, Sanja ^a   Salhi, Abdellah ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATED SPACE; HYPER-HEURISTIC SEARCH SPACES;

COMBINATORIAL OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SYSTEMS ANALYSIS;

HEURISTIC METHODS;

EID: 70449922383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424962     Document Type: Conference Paper

References (21)

1. C. Fayad and S. Petrovic. Genetic algorithm for the real world fuzzy job-shop scheduling. In Proceedings of The International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems IEA/AIE-2005, Lecture Notes in Computer Science, Vol. 3533, pages 524-533. Springer-Verlag, 2005.
2. H. Terashima-Marin, P. Ross, and M. Valenzuela-Rendon. Evolution of constraint satisfaction strategies in examination timetabing. In Proceding of the Genetic and Evolutionary Computation Conference (GECCO 1999), pages 635-642, 1999.
3. E. Soubeiga. Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, School of Computer Science and Information Technology, The University of Nottingham, 2003.
4. R. Bai and G. Kendall. An investigation of automated planograms using a simulated annealing based hyper-heuristic. In T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Metaheuristics: Progress as Real Problem Solvers - (Operations Research/Computer Science Interfaces Series, Vol. 32), pages 87-108, Berlin, Heidelberg, New York, 2005. Springer.
5. G. Kendall and M. Mohamad. Channel assignment optimisation using a hyper-heuristic. In Proceedings of the 2004 IEEE Conference on Cybernetic and Intelligent Systems (CIS2004), pages 790-795. IEEE, 2004.
6. E. Burke, G. Kendall, D. L. Silva, R. O'Brien, and E. Soubeiga. An ant algorithm hyperheuristic for the project presentation scheduling problem. In Proceedings of the Congress on Evolutionary Computation (CEC 2005), pages 2263-2270. IEEE press, 2005.
7. E. K. Burke, G. Kendall, and E. Soubeiga. A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9:451470, 2003.
8. J. W. Herrman, C. Lee and J. Hinchman. General job shop scheduling with a genetic algorithm. Production and Operations Management, 4:30-45, 1995.
9. E. K. Burke, S. Petrovic and R. Qu Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9:115-132, 2006.
10. K. Chakhlevitch and P. Cowling. Choosing the fittest subset of low level heuristics in a hyper-heuristic framework. In G.R. Raidl and J. Gottlieb, editors, EvoCOP 2005, Lecture Notes in Computer Science, Vol. 3448, pages 23-33, Berlin Heidelbergh, 2005. Springer-Verlag.
11. H. Terashima-Marin, A. Moran-Saavedra, and P. Ross. Forming hyperheuristics with GAs when solving 2d-regular cutting stock problems. In Proceedings of Congress on Evolutionary Computation CEC(2005), pages 1104-1110. IEEE Press, 2005.
12. J.A.V.Rodriguez. Meta-hyper-heuristics for hybrid flow shops. Ph.D. thesis, University of Essex, 2007.
13. J. N. D. Gupta. Two-stage hybrid flow shop scheduling problem. Operational Research Society, 39:359-364, 1988.
14. J. Carlier and E. Neron. An exact method for solving the multiprocessor flow-shop. RAIRO Research Operationale, 34:1-25, 2000.
15. A.Vignier,D.Dardilhac,D.Dezalay,and S. Proust. A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop. In Proceedings of the 1996 Conference on Emerging Technologies and Factory Automation, pages 215-220. IEEE press, 1996.
16. D. L. Santos, J. L. Hunssucker, and D. E. Deal. FLOWMULT: Permutation sequences for flow shops with multiple processors. Journal of Information and Optimization Sciences, 16:351-366, 1995.
17. J. Cheng, Y.i Karuno, and H. Kise. A shifting bottleneck approach for a parallel-machine flow shop scheduling problem. Journalofthe Operations Research Society of Japan, 44:140-156, 2001.
18. R.R.Garcia and C. Maroto. A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine elegibility. European Journal of Operational Research, 169:781-800, 2006.
19. A. Allahverdi and F. S. Al-Anzi. Scheduling multi-stage parallel-processor services to minimize average response time. Journalofthe Operational Research Society, 57:101-110, 2006.
20. R. H. Storer, S. D. Wu and R. Vaccari. New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38:1495-1509, 1992.
21. M. Pinedo. Scheduling Theory, Algorithms and Systems. Prentice Hall, 2002.