Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

Monographs in Theoretical Computer Science. An EATCS Series
cover

Models and Algorithms of Time-Dependent Scheduling

Authors: Gawiejnowicz, Stanisław

  • 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  
  • ISBN 978-3-662-59362-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Hardcover ca. 166,39 €
price for Spain (gross)
  • Due: January 9, 2020
  • ISBN 978-3-662-59361-5
  • Free shipping for individuals worldwide
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

This 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 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 scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.


Buy this book

eBook  
  • ISBN 978-3-662-59362-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Hardcover ca. 166,39 €
price for Spain (gross)
  • Due: January 9, 2020
  • ISBN 978-3-662-59361-5
  • Free shipping for individuals worldwide
  • The final prices may differ from the prices shown due to specifics of VAT rules

Services for this Book

Recommended for you

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
2019
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Germany, part of Springer Nature
eBook ISBN
978-3-662-59362-2
Hardcover ISBN
978-3-662-59361-5
Series ISSN
1431-2654
Edition Number
2
Topics