A search space analysis of the Job Shop Scheduling Problem

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 441-453

  Mattfeld, Dirk C ^a   Bierwirth, Christian ^a   Kopfer, Herbert ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Fitness landscape; Local search; Scheduling

Indexed keywords

EID: 0033426610     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018979424002     Document Type: Article

References (22)

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Sci. 34(1988)391-401.
2. E.J. Anderson, C.A. Glass and C.N. Potts, Machine scheduling, in: Local Search in Combinatorial Optimization, eds. E.H.L. Aarts and J.K. Lenstra, Wiley, Chichester, 1997, pp. 361-414.
3. E. Balas and A. Vazacopoulos, Guided local search with the shifting bottleneck for job shop scheduling, Management Science 44(1998)262-275.
4. C. Bierwirth, D.C. Mattfeld and H. Kopfer, On permutation representations for scheduling problems, in: Parallel Problem Solving from Nature IV, eds. H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-P. Schwefel, Springer, Berlin, 1996, pp. 310-318.
5. J. Błażewicz, W. Domschke and E. Pesch, The job shop scheduling problem: Conventional and new solution techniques, EJOR 93(1996)1-30.
6. K.A. Dowsland, Simulated Annealing, in: Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves, Blackwell Scientific, Oxford, 1993, p. 42.
7. B. Freisleben and P. Merz, New genetic local search operators for the traveling salesman problem, in: Parallel Problem Solving from Nature IV, eds. H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-P. Schwefel, Springer, Berlin, 1996, pp. 890-899.
8. J.J. Grefenstette, Incorporating problem-specific knowledge into genetic algorithms, in: Genetic Algorithms and Simulated Annealing, ed. L. Davis, Morgan Kaufmann, Los Altos, CA, 1987, pp. 42-60.
9. S.A. Kauffman, The Origins of Order, Oxford University Press, New York, 1993.
10. B. Manderick, M. de Weger and P. Spiessens, The genetic algorithm and the structure of the fitness landscape, in: Proceedings of the 4th International Conference on Genetic Algorithms, eds. R.K. Belew and L.B. Booker, Morgan Kaufmann, San Mateo, CA, 1991, pp. 143-145.
11. D.C. Mattfeld, Evolutionary Search and the Job Shop, Physica-Verlag, Heidelberg, 1996.
12. H. Mühlenbein, Evolution in time and space - the parallel genetic algorithm, in: Foundations of Genetic Algorithms 1, ed. G.J.I. Rawlins, Morgan Kaufmann, San Mateo, CA, 1991, pp. 316-337.
13. E. Nowicki and S. Smutnicki, A fast taboo search algorithm for the job shop problem, Management Science 42(1996)797-813.
14. Y. Rochat and É.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1(1995)147-167.
15. P.F. Stadler and W. Schnabl, The landscape of the traveling salesman problem, Phys. Lett. A 161 (1992)337-344.
16. K. Steinhöfel, A. Albrecht and C.K. Wong, Two simulated annealing-based heuristics for the job shop scheduling problem, Working Paper, German National Research Center for Information Technology (GMD), Berlin, 1998.
17. R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Sci. 38(1992)1495-1509.
18. É.D. Taillard, Benchmarks for basic scheduling problems, EJOR 64(1993)278-285.
19. É.D. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Science 3(1995)87-105.
20. R.J.M. Vaessens, Generalized job shop scheduling: Complexity and local search, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, 1995.
21. P.J.M. Van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res. 40(1992)113-125.
22. E. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biol. Cybernet. 63(1990)325-336.