Scheduling: Theory, Algorithms, and Systems
This 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.
13 pages matching stochastic dominance in this book
Results 1-3 of 13
What people are saying - Write a review
We haven't found any reviews in the usual places.
Single Machine Models Deterministic
MORE ADVANCED SINGLE MACHINE MODELS
23 other sections not shown
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 date dynamic programming equal Example expected makespan exponentially distributed Figure flexible flow flow shops Gantt chart genetic algorithms Gittins index graph heuristic instance interface 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 operation 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 completion total weighted tardiness Traveling Salesman Problem WSPT zero