Apress Windows 10 Release Sale

Time-Dependent Scheduling

By Stanislaw Gawiejnowicz

  • eBook Price: $119.00
Buy eBook Buy Print Book

Time-Dependent Scheduling Cover Image

This book provides a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. This is the first monograph on time-dependent scheduling.

Full Description

  • Add to Wishlist
  • ISBN13: 978-3-5406-9445-8
  • 396 Pages
  • User Level: Science
  • Publication Date: September 26, 2008
  • Available eBook Formats: PDF

Related Titles

  • Information Systems and Neuroscience
  • BPM - Driving Innovation in a Digital World
  • Data-Driven Process Discovery and Analysis
  • Physical Asset Management
  • Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII
  • UML @ Classroom
  • AIDA-CMK: Multi-Algorithm Optimization Kernel Applied to Analog IC Sizing
  • Computational Color Imaging
  • Uncertainty Quantification in Computational Fluid Dynamics and Aircraft Engines
  • Non-Linear Finite Element Analysis in Structural Mechanics
Full Description
Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, and time-dependent scheduling with two criteria. The reader should be familiar with basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, and he completes the book with an extensive bibliography, and author, symbol and subject indexes. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.
Table of Contents

Table of Contents

  1. Preliminaries.
  2. Problems and Algorithms.
  3. NP
  4. Complete Problems.
  5. Basics of the Scheduling Theory.
  6. Basics of Time
  7. Dependent Scheduling.
  8. Single
  9. Machine Time
  10. Dependent Scheduling.
  11. Parallel
  12. Machine Time
  13. Dependent Scheduling.
  14. Dedicated
  15. Machine Time
  16. Dependent Scheduling.
  17. Approximation and Heuristic Algorithms.
  18. Greedy Algorithms Based on Signatures.
  19. Local Search Algorithms.
  20. Matrix Methods in Time
  21. Dependent Scheduling.
  22. Scheduling
  23. Dependent Deteriorating Jobs.
  24. Time
  25. Dependent Scheduling with Two Criteria.
  26. References.
  27. Author Index.
  28. Symbol Index.
  29. Subject Index.
Errata

Please Login to submit errata.

No errata are currently published

Best-Sellers

    1. Pro SQL Server Internals

      $41.99

      View Details

    2. Beginning 3D Game Development with Unity 4

      $34.99

      View Details

    3. Beginning iPhone Development with Swift

      $31.99

      View Details

    4. Financial Modeling for Business Owners and Entrepreneurs

      $31.99

      View Details