𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Time-Dependent Scheduling

✍ Scribed by Stanislaw Gawiejnowicz


Publisher
Springer
Year
2008
Tongue
English
Leaves
379
Series
Monographs in Theoretical Computer Science. An EATCS Series
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Table of Contents


Front Matter....Pages I-XVI
Front Matter....Pages 1-1
Preliminaries....Pages 1-13
Problems and algorithms....Pages 15-26
NP -complete problems....Pages 27-33
Basics of the scheduling theory....Pages 35-46
Basics of time-dependent scheduling....Pages 47-56
Front Matter....Pages 57-57
Single-machine time-dependent scheduling....Pages 59-153
Parallel-machine time-dependent scheduling....Pages 155-169
Dedicated-machine time-dependent scheduling....Pages 171-200
Front Matter....Pages 201-201
Approximation and heuristic algorithms....Pages 203-244
Greedy algorithms based on signatures....Pages 245-265
Local search algorithms....Pages 267-282
Front Matter....Pages 283-283
Matrix methods in time-dependent scheduling....Pages 285-298
Scheduling dependent deteriorating jobs....Pages 299-319
Time-dependent scheduling with two criteria....Pages 321-337
Back Matter....Pages 339-379


πŸ“œ SIMILAR VOLUMES


Models and Algorithms of Time-dependent
✍ Stanislaw Gawiejnowicz πŸ“‚ Library πŸ“… 2019 πŸ› Springer-Nature New York Inc 🌐 English

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 su

Models and Algorithms of Time-Dependent
✍ StanisΕ‚aw Gawiejnowicz πŸ“‚ Library πŸ“… 2020 πŸ› Springer Berlin Heidelberg;Springer 🌐 English

<p>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

Time-Dependent Path Scheduling: Algorith
✍ Helmut A. Sedding πŸ“‚ Library πŸ“… 2020 πŸ› Springer Fachmedien Wiesbaden;Springer Vieweg 🌐 English

<p><p>Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker’s nonproductive walking time between the moving workpiece and line-side material containers for

Real-time Systems Scheduling
✍ Maryline Chetto πŸ“‚ Library πŸ“… 2014 πŸ› Wiley-ISTE 🌐 English

<p>Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc.Β  Scheduling is a central problem for these computing/communication systems since responsible of software execution in a timely manner. This book provides state of knowledge in this domain with