| 书目名称 | Introduction to Computational Optimization Models for Production Planning in a Supply Chain |
| 编辑 | Stefan Voß,David L. Woodruff |
| 视频video | http://file.papertrans.cn/474/473552/473552.mp4 |
| 概述 | Provides an easy-to-follow introduction to the use of optimization techniques in production planning.Introduces sophisticated models for supply chain management.Includes a chapter presenting implement |
| 图书封面 |  |
| 描述 | provide models that could be used by do-it-yourselfers and also can be used toprovideunderstandingofthebackgroundissuessothatonecandoabetter job of working with the (proprietary) algorithms of the software vendors. In this book we strive to provide models that capture many of the - tails faced by ?rms operating in a modern supply chain, but we stop short of proposing models for economic analysis of the entire multi-player chain. In other words, we produce models that are useful for planning within a supply chain rather than models for planning the supply chain. The usefulness of the models is enhanced greatly by the fact that they have been implemented - ing computer modeling languages. Implementations are shown in Chapter 7, which allows solutions to be found using a computer. A reasonable question is: why write the book now? It is a combination of opportunities that have recently become available. The availability of mod- inglanguagesandcomputersthatprovidestheopportunitytomakepractical use of the models that we develop. Meanwhile, software companies are p- viding software for optimized production planning in a supply chain. The opportunity to make use of such software gives rise |
| 出版日期 | Book 2006Latest edition |
| 关键词 | Linear Programming; Modeling Languages; Planning; Production Planning; Service-oriented Computing; Supply |
| 版次 | 2 |
| doi | https://doi.org/10.1007/3-540-29879-7 |
| isbn_softcover | 978-3-642-06755-6 |
| isbn_ebook | 978-3-540-29879-3 |
| copyright | Springer-Verlag Berlin Heidelberg 2006 |
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-11-20 14:22
发表于 2025-3-21 18:38:35
