Time-Dependent Scheduling

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 env...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Gawiejnowicz, Stanislaw (Auteur)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:Inglés
Publié: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Édition:1st ed. 2008.
Collection:Monographs in Theoretical Computer Science. An EATCS Series,
Sujets:
Computer science.
Computer programming.
Algorithms.
Mathematical optimization.
Artificial intelligence.
Operations research.
Theory of Computation.
Programming Techniques.
Optimization.
Artificial Intelligence.
Operations Research and Decision Theory.
Accès en ligne:Texto Completo
Table des matières:
  • Fundamentals
  • Preliminaries
  • Problems and algorithms
  • NP-complete problems
  • Basics of the scheduling theory
  • Basics of time-dependent scheduling
  • Complexity
  • Single-machine time-dependent scheduling
  • Parallel-machine time-dependent scheduling
  • Dedicated-machine time-dependent scheduling
  • Algorithms
  • Approximation and heuristic algorithms
  • Greedy algorithms based on signatures
  • Local search algorithms
  • Advanced Topics
  • Matrix methods in time-dependent scheduling
  • Scheduling dependent deteriorating jobs
  • Time-dependent scheduling with two criteria.

Documents similaires