Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive studyof 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 advancedtopics 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 First monograph on time-dependent scheduling INDICE: Preliminaries.- Problems and Algorithms.- NP-Complete Problems.- Basics of the Scheduling Theory.- Basics of Time-Dependent Scheduling.- Single-Machine Time-Dependent Scheduling.- Parallel-Machine Time-Dependent Scheduling.- Dedicated-Machine Time-Dependent Scheduling.- Approximation and Heuristic Algorithms.- Greedy Algorithms Based on Signatures.- Local Search Algorithms.- Matrix Methods in Time-Dependent Scheduling.- Scheduling-Dependent Deteriorating Jobs.- Time-Dependent Scheduling with Two Criteria.- References.- Author Index.- Symbol Index.- Subject Index.
- ISBN: 978-3-540-69445-8
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 390
- Fecha Publicación: 01/09/2008
- Nº Volúmenes: 1
- Idioma: Inglés