Scheduling Theory and Its ApplicationsPhilippe Chrétienne, Edward G. Coffman, Jan Karel Lenstra, Zhen Liu 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. |
Contents
Computing NearOptimal Schedules | 1 |
Recent Asymptotic Results in the Probabilistic | 15 |
A Tutorial in Stochastic Scheduling | 33 |
Copyright | |
23 other sections not shown
Common terms and phrases
activity algorithm analysis Applications approach approximation arrival assigned associated assume bound called chapter circuit clustering communication completion computation condition consider constraints copy corresponding critical cycle cyclic scheduling defined delay denote dependence developed distribution edge example execution exists expected extended feasible Figure flow function given graph graph G heuristic increasing independent instance interval least length linear machine makespan minimize node Note obtained operations optimal schedule parallel partial partitioning path performance periodic periodic schedule polynomial possible precedence present priority procedure processing processors proof properties proved queue relation remaining resource respectively routing rule satisfies scheduling problem selection sequence server shown solution solved starting station stochastic task Theorem theory uniform unit variable weights