| 000 | 01655nam a22004817a 4500 | ||
|---|---|---|---|
| 999 |
_c14200 _d14199 |
||
| 003 | OSt | ||
| 005 | 20231113131808.0 | ||
| 008 | 210913s2017 nyua|||| b||| 001 0 eng d | ||
| 020 | _a9781482259216 | ||
| 040 | _cQCPL | ||
| 082 | _a658.53 | ||
| 100 | 1 |
_aBottlik, Geza Paul _eauthor |
|
| 245 | 1 | 3 |
_aAn introduction to the mathematics of planning and scheduling _c/ Geza Paul Bottlik |
| 264 | 1 |
_aNew York : _bRoutledge, _c2017 |
|
| 300 |
_axiv, 209 pages : _billustrations |
||
| 336 |
_2rdacontent _atext |
||
| 337 |
_2rdamedia _aunmediated |
||
| 338 |
_2rdacarrier _avolume |
||
| 504 | _aIncludes bibliographical references (pages 203-205) and index. | ||
| 505 | 0 | _aIntroduction | |
| 505 | 0 | _aA brief history | |
| 505 | 0 | _aInventory | |
| 505 | 0 | _aProduction planning | |
| 505 | 0 | _aManufacturing requirements planning | |
| 505 | 0 | _aScheduling problems | |
| 505 | 0 | _aGeneration of schedules | |
| 505 | 0 | _aAlgorithms for one-machine problems | |
| 505 | 0 | _aAlgorithms for two-machine problems and extensions to multiple machines | |
| 505 | 0 | _aImplicit enumerations | |
| 505 | 0 | _aOptimizations | |
| 505 | 0 | _aHeuristic approaches | |
| 505 | 0 | _aParallel machines and worst case bounds | |
| 505 | 0 | _aRelaxation of assumptions | |
| 505 | 0 | _aDynamic and stochastic problems | |
| 505 | 0 | _aAppendix A. Costing of products and services | |
| 505 | 0 | _aAppendix B. Project scheduling | |
| 505 | 0 | _aAppendix C. Hard problems and NP-completeness | |
| 505 | 0 | _aAppendix D. Problems | |
| 650 |
_aProduction scheduling _xMathematics |
||
| 650 |
_aProduction planning _xMathematics |
||
| 942 |
_2ddc _cBOOK |
||
| 690 | _aMathematics | ||