Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)

Gawiejnowicz, Stanis?aw

ISBN 10: 3662593610 / ISBN 13: 9783662593615

Editore: Springer, 2020

Riguardo questo articolo

Codice articolo ABLIING23Mar3113020318093

Dati bibliografici

• Titolo: Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)
• Editore: Springer
• Data di pubblicazione: 2020
• Lingua: Inglese
• ISBN 10: 3662593610
• ISBN 13: 9783662593615
• Rilegatura: Rilegato
• Edizione: seconda edizione
• Condizione: New

Descrizione articolo

Riassunto

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.<div><br></div><div>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.<div><br></div><div>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.<p></p><br><p></p></div></div>

Dalla quarta di copertina

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.&nbsp;<div><br></div><div>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.&nbsp;</div><div><br></div><div>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.</div>