Scheduling theory and its applications
Covering deterministic scheduling, stochastic scheduling, and the probabilistic analysis of algorithms, this unusually broad view of the subject brings together tutorials, surveys and articles with original results from foremost international experts. The contributions reflect the great diversity in scheduling theory in terms of academic disciplines, applications areas, fundamental approaches and mathematical skills. This book will help researchers to be aware of the progress in the various areas of specialization and the possible influences that this progress may have on their own specialities. Few disciplines are driven so much by continually changing and expanding technology, a fact that gives scheduling a permanence while adding to the excitement of designing and analyzing new systems. The book will be a vital resource for researchers and graduate students of computer science, applied mathematics and operational research who wish to remain up-to-date on the scheduling models and problems of many of the newest technologies in industry, commerce, and the computer and communications sciences.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Recent Asymptotic Results in the Probabilistic
A Tutorial in Stochastic Scheduling
14 other sections not shown
activity analysis Applications approximation algorithms arrival assigned assume asymptotic bandit bipartite graph Brownian Brownian motion Chretienne circuit Coffman communication delays completion consider cycle cyclic scheduling problem defined Demeulemeester denote deterministic disjunctive distribution due dates edge edge coloring example execution exponential exponentially distributed feasible flowtime function Gittins index given graph G heuristic integer interval job shop scheduling Lenstra linear clustering list scheduling makespan multiprocessor multiprocessor scheduling node nonpreemptive number of processors Oper optimal schedule out-forest partial schedule partitioning performance periodic schedule Pinedo polynomial polynomial-time precedence constraints precedence graph preemption preemptive schedule priority procedure processing proof PYRROS random variables resource constraints schedule of length scheduling algorithms Scheduling Theory Section sequence series-parallel graph server solution solved station stochastic scheduling subset T^-complete tandem queues task graph Theorem uniform constraints uniform graph vector weights Weiss Werra