Scheduling: Theory, Algorithms, and SystemsThis comprehensive book focuses on the theory and applications of scheduling. Applications are primarily drawn from production and manufacturing environments, but state principles relevant to other settings as well. Includes numerous worked out examples, Deterministic Models, Stochastic Models, Applications, and more. For anyone interested in scheduling, project management, production planning, and inventory control. |
From inside the book
31 pages matching nonpreemptive static list in this book
Where's the rest of this book?
Results 1-3 of 31
Contents
Preliminaries | 13 |
SINGLE MACHINE MODELS DETERMINISTIC | 33 |
MORE ADVANCED SINGLE MACHINE MODELS | 62 |
Copyright | |
22 other sections not shown
Common terms and phrases
algorithm applied beam search branch and bound Class 1 jobs class of nonpreemptive Cmax computed CP rule denote described determined deterministic disjunctive arcs distributed with rate due dates dynamic programming equal Example expected makespan exponentially distributed Figure flexible flow flow shops Gantt chart genetic algorithms Gittins index graph heuristic instance Lemma Lmax lower bound LRPT machine environment machines in parallel minimizes the expected minimizes the total models node nonpreemptive static list number of jobs number of machines objective function optimal schedule optimal sequence pairwise interchange parallel machine permutation Pinedo polynomial precedence constraints preemptions preemptive dynamic policies priority prmp procedure processed on machine proof queue random variable release dates remaining processing scheduling problems scheduling systems set of jobs setup simulated annealing single machine solution static list policies stochastic dominance strongly NP-hard Theorem three jobs total weighted tardiness Traveling Salesman Problem WSPT zero λι