Interfaces
Conjugate problems in time-dependent scheduling
Journal of Scheduling
Single-machine scheduling time-dependent jobs with resource-dependent ready times
Computers and Industrial Engineering
Single-machine group scheduling problems under the effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling with a nonlinear deterioration function
Information Processing Letters
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
Computers and Industrial Engineering
Preemptive scheduling with simple linear deterioration on a single machine
Theoretical Computer Science
Parallel-machine scheduling with deteriorating jobs and rejection
Theoretical Computer Science
Computers & Mathematics with Applications
A note on makespan minimization in proportionate flow shops
Information Processing Letters
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
Theoretical Computer Science
Note: A note on the complexity of flow-shop scheduling with deteriorating jobs
Discrete Applied Mathematics
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
Computers and Industrial Engineering
Single-machine group scheduling with both learning effects and deteriorating jobs
Computers and Industrial Engineering
Information Sciences: an International Journal
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
Computers and Operations Research
Single-machine makespan minimization scheduling with nonlinear shortening processing times
Computers and Operations Research
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Flowshop scheduling of deteriorating jobs on dominating machines
Computers and Industrial Engineering
Computers and Industrial Engineering
Minimizing makespan in an ordered flow shop with machine-dependent processing times
Journal of Combinatorial Optimization
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
Computers and Operations Research
Online makespan scheduling of linear deteriorating jobs on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Minimizing makespan in three-machine flow shops with deteriorating jobs
Computers and Operations Research
Time-Dependent simple temporal networks
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Computers and Industrial Engineering
The solution algorithms for the multiprocessor scheduling with workspan criterion
Expert Systems with Applications: An International Journal
Computers and Operations Research
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
Information Sciences: an International Journal
A single-machine scheduling with a truncated linear deterioration and ready times
Information Sciences: an International Journal
Hi-index | 0.00 |
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.