Overview
- First monograph on time-dependent scheduling
- Includes supplementary material: sn.pub/extras
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (14 chapters)
-
Front Matter
-
Algorithms
-
Front Matter
-
-
Advanced Topics
-
Front Matter
-
-
Back Matter
Keywords
About this book
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.
Authors and Affiliations
Bibliographic Information
Book Title: Time-Dependent Scheduling
Authors: Stanisław Gawiejnowicz
Series Title: Monographs in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-540-69446-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2008
Hardcover ISBN: 978-3-540-69445-8Published: 26 September 2008
eBook ISBN: 978-3-540-69446-5Published: 26 September 2008
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 1
Number of Pages: XVI, 380
Number of Illustrations: 26 b/w illustrations
Topics: Theory of Computation, Programming Techniques, Algorithm Analysis and Problem Complexity, Optimization, Artificial Intelligence, Operations Research/Decision Theory