Individual chapters look at the theory of apportionment and just-in-time sequences; minimization of just-in-time sequence deviation; optimality of cyclic sequences and the oneness; bottleneck minimization; competition-free instances, Fraenkel’s Conjecture, and optimal admission sequences; response time variability; applications to the Liu-Layland Problem and pinwheel scheduling; temporal capacity constraints and supply chain balancing; fair queuing and stride scheduling; and smoothing and batching.
Individual chapters look at the theory of apportionment and just-in-time sequences; minimization of just-in-time sequence deviation; optimality of cyclic sequences and the oneness; bottleneck minimization; competition-free instances, Fraenkel’s Conjecture, and optimal admission sequences; response time variability; applications to the Liu-Layland Problem and pinwheel scheduling; temporal capacity constraints and supply chain balancing; fair queuing and stride scheduling; and smoothing and batching.

Proportional Optimization and Fairness
290
Proportional Optimization and Fairness
290Hardcover(2009)
Product Details
ISBN-13: | 9780387877181 |
---|---|
Publisher: | Springer US |
Publication date: | 12/02/2008 |
Series: | International Series in Operations Research & Management Science , #127 |
Edition description: | 2009 |
Pages: | 290 |
Product dimensions: | 6.30(w) x 9.30(h) x 0.80(d) |