Ebook: Proportional Optimization and Fairness

Proportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field.

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 queueing and stride scheduling; and smoothing and batching.

---

Proportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field.

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 queueing and stride scheduling; and smoothing and batching.

---

Proportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field.

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 queueing and stride scheduling; and smoothing and batching.

Content:
Front Matter....Pages i-xxi
Preliminaries....Pages 1-3
The Theory of Apportionment and Just-In-Time Sequences....Pages 5-31
Minimization of Just-In-Time Sequence Deviation....Pages 33-54
Optimality of Cyclic Sequences and the Oneness....Pages 55-80
Bottleneck Minimization....Pages 81-104
Competition-Free Instances, The Fraenkel's Conjecture, and Optimal Admission Sequences....Pages 105-139
Response Time Variability....Pages 141-166
Applications to the Liu—Layland Problem and Pinwheel Scheduling....Pages 167-193
Temporal Capacity Constraints and Supply Chain Balancing....Pages 195-225
Fair Queueing and Stride Scheduling....Pages 227-249
Smoothing and Batching....Pages 251-272
Back Matter....Pages 273-288

---

Proportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field.

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 queueing and stride scheduling; and smoothing and batching.

Content:
Front Matter....Pages i-xxi
Preliminaries....Pages 1-3
The Theory of Apportionment and Just-In-Time Sequences....Pages 5-31
Minimization of Just-In-Time Sequence Deviation....Pages 33-54
Optimality of Cyclic Sequences and the Oneness....Pages 55-80
Bottleneck Minimization....Pages 81-104
Competition-Free Instances, The Fraenkel's Conjecture, and Optimal Admission Sequences....Pages 105-139
Response Time Variability....Pages 141-166
Applications to the Liu—Layland Problem and Pinwheel Scheduling....Pages 167-193
Temporal Capacity Constraints and Supply Chain Balancing....Pages 195-225
Fair Queueing and Stride Scheduling....Pages 227-249
Smoothing and Batching....Pages 251-272
Back Matter....Pages 273-288
....