Skip to main content
Presented to you through Paradigm Publishing Services

Princeton University Press

Visit our Partner Page See all our books
Chapter
Licensed
Unlicensed Requires Authentication

11. Machine scheduling

  • , and
© 2018 Princeton University Press, Princeton

© 2018 Princeton University Press, Princeton

Chapters in this book

  1. Frontmatter i
  2. Table of contents v
  3. Preface to the paperback edition vii
  4. Preface ix
  5. Contributors xi
  6. 1. Introduction 1
  7. 2. Computational complexity 19
  8. 3. Local improvement on discrete structures 57
  9. 4. Simulated annealing 91
  10. 5. Tabu search 121
  11. 6. Genetic algorithms 137
  12. 7. Artificial neural networks 173
  13. 8. The traveling salesman problem: a case study 215
  14. 9. Vehicle routing: modern heuristics 311
  15. 10. Vehicle routing: handling edge exchanges 337
  16. 11. Machine scheduling 361
  17. 12. VLSI layout synthesis 415
  18. 13. Code design 441
  19. Bibliography 457
  20. Author index 495
  21. Subject index 507
Local Search in Combinatorial Optimization
This chapter is in the book Local Search in Combinatorial Optimization
https://doi.org/10.1515/9780691187563-014

Chapters in this book

  1. Frontmatter i
  2. Table of contents v
  3. Preface to the paperback edition vii
  4. Preface ix
  5. Contributors xi
  6. 1. Introduction 1
  7. 2. Computational complexity 19
  8. 3. Local improvement on discrete structures 57
  9. 4. Simulated annealing 91
  10. 5. Tabu search 121
  11. 6. Genetic algorithms 137
  12. 7. Artificial neural networks 173
  13. 8. The traveling salesman problem: a case study 215
  14. 9. Vehicle routing: modern heuristics 311
  15. 10. Vehicle routing: handling edge exchanges 337
  16. 11. Machine scheduling 361
  17. 12. VLSI layout synthesis 415
  18. 13. Code design 441
  19. Bibliography 457
  20. Author index 495
  21. Subject index 507
Downloaded on 29.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/9780691187563-014/html?lang=en
Scroll to top button