Monographs in Theoretical Computer Science. An EATCS Series

Models and Algorithms of Time-Dependent Scheduling

Authors: Gawiejnowicz, Stanisław

Free Preview
  • 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
see more benefits

Buy this book

eBook $109.00
price for USA in USD
  • ISBN 978-3-662-59362-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $219.99
price for USA in USD
  • ISBN 978-3-662-59361-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Softcover $149.99
price for USA in USD
  • ISBN 978-3-662-59364-6
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
About this book

This is a comprehensive study of various time-dependent scheduling problems 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, time-dependent scheduling with two criteria and time-dependent two-agent scheduling.
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 of the 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)


Table of contents (21 chapters)

Table of contents (21 chapters)

Buy this book

eBook $109.00
price for USA in USD
  • ISBN 978-3-662-59362-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $219.99
price for USA in USD
  • ISBN 978-3-662-59361-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Softcover $149.99
price for USA in USD
  • ISBN 978-3-662-59364-6
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Models and Algorithms of Time-Dependent Scheduling
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Copyright
2020
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Germany, part of Springer Nature
eBook ISBN
978-3-662-59362-2
DOI
10.1007/978-3-662-59362-2
Hardcover ISBN
978-3-662-59361-5
Softcover ISBN
978-3-662-59364-6
Series ISSN
1431-2654
Edition Number
2
Number of Pages
XXIV, 538
Number of Illustrations
24 b/w illustrations
Topics