Skip to main content
SpringerLink
Log in
Book cover

Handbook on Scheduling pp 9–56Cite as

Basics

  • Chapter

  • 2215 Accesses

Part of the book series: International Handbook on Information Systems ((INFOSYS))

Abstract

In this chapter we provide the reader with basic notions used throughout the book. After a short introduction into sets and relations, decision problems, optimization problems and the encoding of problem instances are discussed. The way algorithms will be represented and problem membership of complexity classes are other essential issues which will be discussed. Afterwards graphs, especially certain types such as precedence graphs and networks that are important for scheduling problems, are presented. The last two sections deal with algorithmic methods used in scheduling such as enumerative algorithms (e. g. dynamic programming and branch and bound) and heuristic approaches (e. g. tabu search, simulated annealing, ejection chains, and genetic algorithms).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Agin, Optimum seeking with branch and bound, Management Sci. 13, 1966, B176–185.

    Google Scholar 

  2. E. J. Anderson, C. A. Glass, C. N. Potts, Local search in combinatorial optimization: applications in machine scheduling, Working paper, University of Southampton, 1995.

    Google Scholar 

  3. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  4. E. H. L. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines, J. Wiley, Chichester, 1989.

    Google Scholar 

  5. E. H. L. Aarts, J. K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.

    Google Scholar 

  6. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows, Prentice Hall, Engle-wood Cliffs, N.J., 1993.

    Google Scholar 

  7. K. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.

    Google Scholar 

  8. R. Bellman, S. E. Dreyfus, Applied Dynamic Programming, Princeton University Press, Princeton, N.J., 1962.

    Google Scholar 

  9. R. Bellman, Dynamic Programming, Princeton University Press, Princeton, N.J., 1957.

    Google Scholar 

  10. C. Berge, Theory of Graphs and its Applications, Methuen, London, 1962.

    Google Scholar 

  11. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.

    Google Scholar 

  12. N. E. Collins, R. W. Eglese, B. L. Golden, Simulated annealing-an annotated bibliography, American J. Math. Management Sci. 8, 1988, 209–307.

    Google Scholar 

  13. V. Cerny, Thermodynamical approach to the traveling salesman problem; an efficient simulation algorithm, J. Optimization Theory and Applications 45, 1985, 41–51.

    Article  Google Scholar 

  14. B. V. Cherkasskij, Algoritm postrojenija maksimalnogo potoka w sieti so sloznostju 0(V2 E1/2) operacij, Matematiczeskije Metody Reszenija Ekonomiczeskich Problem 7, 1977, 117–125.

    Google Scholar 

  15. T.-Y. Cheung, Computational comparison of eight methods for the maximum network flow problem, ACM Trans. Math. Software 6, 1980, 1–16.

    Article  Google Scholar 

  16. M. Chams, A. Hertz, D. de Werra, Some experiments with simulated annealing for colouring graphs, European J. Oper. Res. 32, 1987, 260–266.

    Article  Google Scholar 

  17. Y. Crama, A. Kolen, E. Pesch, Local search in combinatorial optimization, Lecture Notes in Computer Science 931, 1995, 157–174.

    Google Scholar 

  18. E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.

    Google Scholar 

  19. S. A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symposium on Theory of Computing, 1971, 151–158.

    Google Scholar 

  20. E. V. Denardo, Dynamic Programming: Models and Applications, Prentice-Hall, Englewood Cliffs, N.J., 1982.

    Google Scholar 

  21. E. A. Dinic, Algoritm reszenija zadaczi o maksimalnom potokie w sieti so stepennoj ocenkoj, Dokl. Akad. Nauk SSSR 194, 1970, 1277–1280.

    Google Scholar 

  22. S. E. Dreyfus, A. M. Law, The Art and Theory of Dynamic Programming, Academic Press, New York, 1979.

    Google Scholar 

  23. U. Dorndorf, E. Pesch, Fast clustering algorithms, ORSA J. Comput. 6, 1994, 141–153.

    Google Scholar 

  24. U. Dorndorf, E. Pesch, Evolution based learning in a job shop scheduling environment, Computers and Oper. Res. 22, 1995, 25–40.

    Article  Google Scholar 

  25. G. Dueck, T. Scheuer, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comp. Physics 90, 1990, 161–175.

    Article  Google Scholar 

  26. A. E. Eiben, E. H. L. Aarts, K. H. van Hee, Global convergence of genetic algorithms: A Markov Chain analysis, Lecture Notes in Computer Science 496, 1991, 4–9.

    Google Scholar 

  27. J. Edmonds, Paths, trees and flowers, Canadian J. Math. 17, 1965, 449–467.

    Google Scholar 

  28. J. Edmonds, R. M. Karp, Theoretical improvement in algorithmic efficiency for network flow problem, J. Assoc. Comput. Mach. 19, 1972, 248–264.

    Google Scholar 

  29. S. Even, Graph Algorithms, Computer Science Press Inc., New York, 1979.

    Google Scholar 

  30. L. R. Ford, Jr., D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, N.J., 1962.

    Google Scholar 

  31. P.C. Fishburn, Intransitive indifference in preference theory: A survey, Oper. Res. 18(1970)207–228

    Google Scholar 

  32. F. Glover, H. J. Greenberg, New approaches for heuristic search: A bilateral linkage with artificial intelligence, European J. Oper. Res. 13, 1989, 563–573.

    Google Scholar 

  33. M. R. Garey, D. S. Johnson, Strong NP-completeness results: motivation, examples, and implications, J. Assoc. Comput. Mach. 25, 1978, 499–508.

    Google Scholar 

  34. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  35. F. Glover, M. Laguna, Tabu Search, Kluwer Academic Publ., Boston, 1997.

    Google Scholar 

  36. F. Glover, Heuristic for integer programming using surrogate constraints, Decision Sciences 8, 1977, 156–160.

    Article  Google Scholar 

  37. F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Oper. Res. 13, 1986, 533–549.

    Article  Google Scholar 

  38. F. Glover, Tabu-search-Part I, ORSA J. Comput. 1, 1989, 190–206.

    Google Scholar 

  39. R Glover, Tabu Search-Part II, ORSA J. Comput. 2, 1990, 4–32.

    Google Scholar 

  40. F. Glover, Tabu search: a tutorial, Interfaces 20(4), 1990, 74–94.

    Google Scholar 

  41. F. Glover, Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, Working paper, University of Colorado, Boulder, 1991.

    Google Scholar 

  42. F. Glover, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Appl. Math, 65, 1996, 223–253.

    Article  Google Scholar 

  43. F. Glover, Scatter search and star-paths: Beyond the genetic metaphor, OR Spektrum 17, 1995, 125–137.

    Article  Google Scholar 

  44. F. Glover, M. Laguna, E. Taillard, D. de Werra (eds.), Tabu Search, Annals of Operations Research 41, Baltzer, Basel, 1993.

    Google Scholar 

  45. F. Glover, C. McMillan, The general employee scheduling problem: An integration of MS and AI, Computers and Oper. Res. 13, 1986, 563–573.

    Article  Google Scholar 

  46. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass., 1989.

    Google Scholar 

  47. P. Hansen, B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44, 1990, 279–303.

    Article  Google Scholar 

  48. J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  49. R. A. Howard, Dynamic Programming and Markov Processes, MIT Press, Cambridge, Mass., 1969.

    Google Scholar 

  50. A. Hertz, D. de Werra, The tabu search metaheuristic: How we use it, Ann. Math. Artif. Intell. 1, 1990, 111–121.

    Article  Google Scholar 

  51. D. S. Johnson, C. R. Aragon, L. A. McGeoch, C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning, Oper. Res. 37, 1989, 865–892.

    Google Scholar 

  52. D. S. Johnson, C. R. Aragon, L. A. McGeoch, C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning, Oper. Res. 39, 1991, 378–406.

    Google Scholar 

  53. D. S. Johnson, A Catalog of Complexity Classes, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier, New York, 1990, Ch.2.

    Google Scholar 

  54. D. S. Johnson, Local optimization and the traveling salesman problem, Lecture Notes in Computer Science 443, 1990, 446–461.

    Google Scholar 

  55. K. de Jong, Genetic-algorithm-based learning, in: Y. Kodratoff, R. Michalski (eds.) Machine Learning, Vol. III, Morgan Kaufmann, San Mateo, 1990, 611–638.

    Google Scholar 

  56. D. S. Johnson, C. H. Papadimitriou, M. Yannakakis, How easy is local search? J. Computer System Sci. 37, 1988, 79–100.

    Article  Google Scholar 

  57. R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher (eds.), Complexity of Computer Computation, Plenum Press, New York, 1972, 85–104.

    Google Scholar 

  58. A. W. Karzanov, Nachozdenije maksimalnogo potoka w sieti metodom predpotokow, Dokl. Akad. Nauk SSSR 215, 1974, 434–437.

    Google Scholar 

  59. S. Kirkpatrick, C. D. Gelatt Jr., M. P. Vecchi, Optimization by simulated annealing, Science 220, 1983, 671–680.

    Article  Google Scholar 

  60. A. Kolen, E. Pesch, Genetic local search in combinatorial optimization, Discrete Appl. Math. 48, 1994, 273–284.

    Article  Google Scholar 

  61. M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors, Inform. Process. Lett. 24, 1987, 141–147.

    Article  Google Scholar 

  62. P. J. M. van Laarhoven, E. H. L. Aarts, Simulated Annealing: Theory and Applications, Reider, Dordrecht, 1987.

    Google Scholar 

  63. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.

    Google Scholar 

  64. V. J. Leon, R. Balakrishnan, Strength and adaptability of problem-space based neigborhoods for resource constrained scheduling, OR Spektrum 17, 1995, 173–182.

    Article  Google Scholar 

  65. J. K. Lenstra, Sequencing by Enumerative Methods, Mathematical Centre Tracts 69, Amsterdam, 1977.

    Google Scholar 

  66. S. Lin, B. W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21, 1973, 498–516.

    Google Scholar 

  67. J. K. Lenstra, A. H. G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 1, 1977, 343–362.

    Google Scholar 

  68. E. L. Lawler, D. E. Wood, Branch and bound methods: a survey, Oper. Res. 14, 1966, 699–719.

    Google Scholar 

  69. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1997.

    Google Scholar 

  70. L. G. Mitten, Branch-and-bound methods: general formulation and properties, Oper. Res. 18, 1970, 24–34.

    Article  Google Scholar 

  71. M. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equation of state calculations by fast computing machines, J. Chemical Physics 21, 1953, 1087–1092.

    Article  Google Scholar 

  72. I. H. Osman, J. P. Kelly, Meta-Heuristics: Theory and Applications, Kluwer, Dordrecht, 1996.

    Google Scholar 

  73. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, Mass., 1994.

    Google Scholar 

  74. E. Pesch, Learning in Automated Manufacturing, Physica, Heidelberg, 1994.

    Google Scholar 

  75. E. Pesch, F. Glover, TSP ejection chains, Discrete Appl. Math. 76, 1997, 165–181.

    Article  Google Scholar 

  76. C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, N.J., 1982.

    Google Scholar 

  77. E. Pesch, S. Voß (eds.), Applied Local Search, OR Spektrum 17, 1995.

    Google Scholar 

  78. I. Rechenberg, Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Problemata, Frommann-Holzboog, 1973.

    Google Scholar 

  79. C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publishing, 1993.

    Google Scholar 

  80. C. Rego, A subpath ejection method for the vehicle routing problem, Management Sci. 44, 1998, 1447–1459.

    Google Scholar 

  81. A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Martinus Nijhoff, The Hague, 1976.

    Google Scholar 

  82. A. H. G. Rinnooy Kan, Probabilistic analysis of approximation algorithms, Ann. Discrete Math. 31, 1987, 365–384.

    Google Scholar 

  83. H.-P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, Birkhäuser, Basel, 1977.

    Google Scholar 

  84. E. A. Silver, R. V. Vidal, D. de Werra, A tutorial on heuristic methods, European J. Oper. Res. 5, 1980, 153–162.

    Article  Google Scholar 

  85. N. L. J. Ulder, E. H. L. Aarts, H.-J. Bandelt, P. J. M. van Laarhoven, E. Pesch, Genetic local search algorithms for the traveling salesman problem, Lecture Notes in Computer Science 496, 1991, 109–116.

    Article  Google Scholar 

  86. R. J. M. Vaessens, E. H. L. Aarts, J. K. Lenstra, Job shop scheduling by local search, ORSA J. Comput. 13, 1996, 302–317.

    Google Scholar 

  87. J. Valdes, R. E. Tarjan, E. L. Lawler, The recognition of series parallel digraphs, SIAM J. Comput. 11, 1982, 298–313.

    Article  Google Scholar 

  88. D. de Werra, A. Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11, 1989, 131–141.

    Article  Google Scholar 

  89. M. Yannakakis, The analysis of local search problems and their heuristics, Lecture Notes in Computer Science 415, 1990, 298–311.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Basics. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_2

Download citation

Publish with us

Policies and ethics

Search

Navigation