Ebook: Time-Dependent Scheduling

hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality of a schedule is measured by a criterion function. The aim of scheduling is to ?nd, among all feasible schedules, a schedule that optimizes the criterion function. A solution to an arbitrary scheduling problem consists in giving a polynomial-time algorithm generating either an optimal schedule or a schedule that is close to the optimal one, if the given scheduling problem has been proved to be computationally intractable. The scheduling problems are subject of interest of the scheduling theory, originated in mid-?fties of the twentieth century. The theory has been developing dynamically and new research areas constantly come into existence. The subject of this book, ti- dependent scheduling, is one of such areas. In time-dependent scheduling, the processing time of a job is variable and depends on the starting time of the job. This crucial assumption allows us to apply the scheduling theory to a broader spectrum of problems. For example, in the framework of the time-dependent scheduling theory we may consider the problems of repayment of multiple loans, ?re ?ghting and maintenance assignments. In this book, we will discuss algorithms and complexity issues concerning various time-dependent scheduling problems.

---

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.

---

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.

Content:
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

---

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.

Content:
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
....