| Vorliegende Sprache |
eng |
| Hinweise auf parallele Ausgaben |
286153459 Buchausg. u.d.T.: ‡Kubiak, Wieslaw: Proportional optimization and fairness |
| ISBN |
978-0-387-87718-1 |
| Name |
Kubiak, Wieslaw |
| Hillier, Frederick S. |
| ANZEIGE DER KETTE |
Hillier, Frederick S. |
| T I T E L |
Proportional Optimization and Fairness |
| Verlagsort |
Boston, MA |
| Verlag |
Springer US |
| Springer |
| Erscheinungsjahr |
2009 |
| 2009 |
| Umfang |
Online-Ressource (digital) |
| Reihe |
International Series in Operations Research & Management Science ; 127 |
| Notiz / Fußnoten |
Includes bibliographical references (p. 273-279) and index |
| Weiterer Inhalt |
CONTENTS; 1 Preliminaries; 2 The Theory of Apportionment and Just-In-Time Sequences; 2.1 Introduction; 2.2 The Apportionment Problem; 2.3 Which Apportionment?; 2.4 Apportionment Methods; 2.5 What is Impossible?; 2.6 Coalitions and Schisms; 2.7 From Apportionments to Just-In-Time Sequences; 2.8 Which Just-In-Time Apportionments?; 2.9 The Consistency of Webster's Method; 2.10 Exercises; 2.11 Comments and References; 3 Minimization of Just-In-Time Sequence Deviation; 3.1 Introduction; 3.2 Minimization of Total Deviation; 3.3 The Transformation to the Assignment Problem. 3.4 The Monge Property of Assignment Costs3.5 The Equivalence; 3.6 The Solution; 3.7 Minimization of Maximum Deviation; 3.8 The Bottleneck Assignment; 3.9 The Bottleneck Monge Property; 3.10 Exercises; 3.11 Comments and References; 4 Optimality of Cyclic Sequences and the Oneness; 4.1 Introduction; 4.2 Symmetries of C i jk s for Symmetric F is; 4.3 The Folding, Shuffling, and Unfolding of Sequences; 4.4 Optimality of Cyclic Solutions for Total Deviation; 4.5 Optimality of Cyclic Solutions for Maximum Deviation; 4.6 The Oneness; 4.7 Exercises; 4.8 Comments and References. 5 Bottleneck Minimization5.1 Introduction; 5.2 The Position Window Based Algorithm; 5.3 The Complexity; 5.4 Bounds on the Bottleneck; 5.5 Main Properties; 5.6 The Absence of Competition; 5.7 Exercises; 5.8 Comments and References; 6 Competition-Free Instances, The Fraenkel's Conjecture,and Optimal Admission Sequences; 6.1 Introduction; 6.2 The Competition-Free and the Power-of-Two Instances; 6.3 Bottleneck of the Competition-Free Instances; 6.4 Polygons of the Competition-Free Instances; 6.5 Characteristics of Competition-Free Instances; 6.6 The Competition-Free Instances for n = 3. 6.7 Putting it Together6.8 Fraenkel's Conjecture and Competition-Free Instances; 6.9 Regular Sequences and Multimodular Functions; 6.10 Optimal Admission of Arrivals; 6.11 Multimodular Function on Just-In-Time Sequences; 6.12 Exercises; 6.13 Comments and References; 7 Response Time Variability; 7.1 Introduction; 7.2 Optimization and Complexity; 7.3 Heuristics; 7.4 Mathematical Programming Formulation; 7.5 The Algorithm; 7.6 Exercises; 7.7 Comments and References; 8 Applications to the Liu-Layland Problem and Pinwheel Scheduling; 8.1 Introduction; 8.2 The Liu-Layland Problem. 8.3 Just-In-Time Solution of the Liu-Layland Problem8.4 Divisor Methods for the Liu-Layland Problem; 8.5 The Pinwheel Scheduling; 8.6 Applications to Pinwheel Scheduling; 8.7 Exercises; 8.8 Comments and References; 9 Temporal Capacity Constraints and Supply Chain Balancing; 9.1 Introduction; 9.2 The Car Sequencing Problem: A Model of Temporal CapacityConstraints; 9.3 The Complexity of the Car Sequencing Problem; 9.4 Dynamic Programming for the Carsequencing Problem; 9.5 Simple Necessary Conditions; 9.6 IP Formulation and Heuristics for the Car Sequencing Problem. 9.7 Mixed-Model, Pull Supply Chains |
| Titelhinweis |
Buchausg. u.d.T.: ‡Kubiak, Wieslaw: Proportional optimization and fairness |
| ISBN |
ISBN 978-0-387-87719-8 |
| Klassifikation |
KJT |
| KJMD |
| BUS049000 |
| *90-02 |
| 90B05 |
| 90B35 |
| 658.40301 |
| 519.6 |
| 650 |
| HD30.23 |
| QH 400 |
| Kurzbeschreibung |
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 queuing and stride scheduling, and smoothing and batching. |
| 1. Schlagwortkette |
Operations Research |
| Just-in-time-Produktion |
| ANZEIGE DER KETTE |
Operations Research -- Just-in-time-Produktion |
| 2. Schlagwortkette |
Operations Research |
| Just-in-time-Produktion |
| ANZEIGE DER KETTE |
Operations Research -- Just-in-time-Produktion |
| SWB-Titel-Idn |
301142327 |
| Signatur |
Springer E-Book |
| Bemerkungen |
Elektronischer Volltext - Campuslizenz |
| Elektronische Adresse |
$uhttp://dx.doi.org/10.1007/978-0-387-87719-8 |
| Internetseite / Link |
Volltext |
| Siehe auch |
Volltext |
| Siehe auch |
Cover |
| Siehe auch |
Inhaltstext |
