Authors:
- Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started
- Author includes numerous examples, figures and tables, and different classes of algorithms presented using pseudocode
- Previous edition focused on computational complexity of time-dependent scheduling problems, this edition concentrates on models of time-dependent job processing times and algorithms for solving scheduling problems
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (21 chapters)
-
Front Matter
-
FUNDAMENTALS
-
Front Matter
-
-
SCHEDULING MODELS
-
Front Matter
-
-
POLYNOMIAL PROBLEMS
-
Front Matter
-
-
ALGORITHMS
-
Front Matter
-
About this book
The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, 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, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes.
The previous edition ofthe book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.
Reviews
“The book presents a lot of material for time dependent scheduling, it is full of algorithms (in pseudo-code) and of complexity proofs, it provides a deep insight to the theory and practice of scheduling.” (Helmut G. Kahlbacher, zbMATH 1453.90002, 2021)
Authors and Affiliations
-
Faculty of Mathematics and Computer Science, Adam Mickiewicz University in Poznań, Poznań, Poland
Stanisław Gawiejnowicz
Bibliographic Information
Book Title: Models and Algorithms of 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-662-59362-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Germany, part of Springer Nature 2020
Hardcover ISBN: 978-3-662-59361-5Published: 14 June 2020
Softcover ISBN: 978-3-662-59364-6Published: 16 July 2021
eBook ISBN: 978-3-662-59362-2Published: 13 June 2020
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 2
Number of Pages: XXIV, 538
Number of Illustrations: 24 b/w illustrations
Topics: Theory of Computation, Optimization, Operations Research/Decision Theory