Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 21-30

  Bierwirth, Christian ^a   Mattfeld, Dirk Christian ^b   Watson, Jean Paul ^c  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b UNIVERSITY OF HAMBURG   (Germany)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

COMBINATORIAL OPTIMIZATION PROBLEMS; FITNESS LANDSCAPE; HEIDELBERG; JOB SHOP SCHEDULING PROBLEMS; LOCAL SEARCH ALGORITHM; RANDOM WALK;

JOB SHOP SCHEDULING;

EID: 24644444385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_3     Document Type: Article

References (25)

1. J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34:391-401, 1988.
2. E.J. Anderson, C.A. Glass, and C.N. Potts. Applications in machine scheduling. In E.A. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 361-414. John Wiley and Sons, 1997.
3. E. Balas and A. Vazacopoulos. Guided local search with the shifting bottleneck for job shop scheduling. Management Science, 44:262-275, 1998.
4. J. Blazewicz, W. Domschke, and E. Pesch. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93:1-33, 1996.
5. C. Smutnicki E. Nowicki. Some new ideas in ts for job - shop scheduling. In C. Rego and B. Alidaee, editors, Adaptive Memory and Evolution. Tabu Search and Scatter Search. Kluwer, 2003.
6. H. Fisher and G.L. Thompson. Probabilistic learning combinations of local jobshop scheduling rules. In Industrial Scheduling, pages 225-251. Prentice-Hall, 1963.
7. W. Hordijk. A measure of landscapes. Evolutionary Computation, 4:335-360, 1997.
8. A.S. Jain and S. Meeran. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113:390-434, 1999.
9. T. Jones. Evolutionary Algorithms, fitness landscapes and search. PhD thesis, University of New Mexico, Albuquerque, NM, 1995.
10. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proc of the 6th Int. Conf. on Genetic Algorithms, pages 184-192. Morgan Kaufmann Publishers, 1995.
11. S.A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the sciences of complexity, pages 527-618. Addison-Wesley, 1989.
12. S. Kirkpatrick and G. Toulouse. Configuration space analysis for traveling salesman problems. Journal de Physique, 46(1277-1292), 1985.
13. M. Kolonko. Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research, 113:123-136, 1999.
14. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by simulated annealing. Operations Research, 40:113-125, 1992.
15. D.O. Mattfeld. Evolutionary Search and the Job Shop. Physica - Verlag, 1996.
16. D.C. Mattfeld, C. Bierwirth, and H. Kopfer. A search space analysis of the job shop scheduling. Annals of Operations Research, 86:441-453, 1999.
17. P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation, 4:337-352, 2000.
18. E. Nowicki and S. Smutnicki. A fast tabu search algorithm for the job shop problem. Management Science, 42:797-813, 1996.
19. Colin R. Reeves. Landscapes, operators and heuristic search. Annals of Operational Research, 86:473-490, 1999.
20. Colin R. Reeves. Experiments with tunable fitness landscapes. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, and H.-P. Schwefel, editors, Parallel Problem. Solving from Nature - PPSN VI, pages 139-148, 2000.
21. P.F. Stadler. Fitness landscapes. In M. Lässig and A. Valleriani, editors, Biological and Statistical Physics, pages 187-202. Springer Verlag, 2002.
22. P.F. Stadler and W. Schnabl. The landscape of the traveling salesman problem. Physics Letters A, 161:337-344, 1992.
23. É.D. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3:87-105, 1995.
24. J.-P. Watson, L.D. Whitley, and A.E. Howe. A dynamic model of tabu search for the job - shop scheduling problem. In G. Kendall, E. Burke, and S. Petrovic, editors, Proc. of the 1st Multidisciplinary Int. Conf, on Scheduling: Theory and Applications, pages 320-336. University of Nottingham, 2003.
25. E. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybernetics, 63:325-336, 1990.