| 書目名稱 | Proportional Optimization and Fairness |
| 編輯 | Wieslaw Kubiak |
| 視頻video | http://file.papertrans.cn/762/761380/761380.mp4 |
| 概述 | Presents the latest research on just-in-time (JIT) sequencing and the efforts to apportion resources fairly within the process.Extends JIT sequencing to fields like computer science, communications an |
| 叢書名稱 | International Series in Operations Research & Management Science |
| 圖書封面 |  |
| 描述 | .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.. |
| 出版日期 | Book 2009 |
| 關鍵詞 | capacity; optimization; production; research & development (R&D); scheduling; supply chain |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-0-387-87719-8 |
| isbn_softcover | 978-1-4419-4687-4 |
| isbn_ebook | 978-0-387-87719-8Series ISSN 0884-8289 Series E-ISSN 2214-7934 |
| issn_series | 0884-8289 |
| copyright | Springer-Verlag US 2009 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 14:41
發(fā)表于 2025-3-21 18:55:54
