Skip to main content
SpringerLink
Log in

A search space analysis of the Job Shop Scheduling Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

A computational study for the Job Shop Scheduling Problem is presented. Thereby,emphasis is put on the structure of the search space as it appears for local search. A statisticalanalysis of the search space reveals the impact of inherent properties of the problem onlocal search based heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Sci. 34(1988)391-401.

    Google Scholar 

  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.

    Google Scholar 

  3. E. Balas and A. Vazacopoulos, Guided local search with the shifting bottleneck for job shop scheduling, Management Science 44(1998)262-275.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  9. S.A. Kauffman, The Origins of Order, Oxford University Press, New York, 1993.

    Google Scholar 

  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.

    Google Scholar 

  11. D.C. Mattfeld, Evolutionary Search and the Job Shop, Physica-Verlag, Heidelberg, 1996.

    Google Scholar 

  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.

    Google Scholar 

  13. E. Nowicki and S. Smutnicki, A fast taboo search algorithm for the job shop problem, Management Science 42(1996)797-813.

    Google Scholar 

  14. Y. Rochat and É.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1(1995)147-167.

    Google Scholar 

  15. P.F. Stadler and W. Schnabl, The landscape of the traveling salesman problem, Phys. Lett. A 161(1992)337-344.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  18. É.D. Taillard, Benchmarks for basic scheduling problems, EJOR 64(1993)278-285.

    Google Scholar 

  19. É.D. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Science 3(1995)87-105.

    Google Scholar 

  20. R.J.M. Vaessens, Generalized job shop scheduling: Complexity and local search, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, 1995.

    Google Scholar 

  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.

    Google Scholar 

  22. E. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biol. Cybernet. 63(1990)325-336.

    Google Scholar 

Download references

Authors
  1. D.C. Mattfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Bierwirth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Kopfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mattfeld, D., Bierwirth, C. & Kopfer, H. A search space analysis of the Job Shop Scheduling Problem. Annals of Operations Research 86, 441–453 (1999). https://doi.org/10.1023/A:1018979424002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018979424002

Keywords

Search

Navigation