Deterministic Production Planning: Algorithms and Complexity
A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he subject...
Uloženo v:
| Vydáno v: | Management science Ročník 26; číslo 7; s. 669 - 679 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Linthicum
INFORMS
01.07.1980
Institute of Management Sciences Institute for Operations Research and the Management Sciences |
| Edice: | Management Science |
| Témata: | |
| ISSN: | 0025-1909, 1526-5501 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he subject to capacity limits. The computational complexity of the problems in this class is investigated. Several algorithms proposed for their solution are described and analyzed. It is also shown that some special cases are NP -hard and hence unlikely to be solvable in polynomial time. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Statistics/Data Report-1 ObjectType-Article-1 |
| ISSN: | 0025-1909 1526-5501 |
| DOI: | 10.1287/mnsc.26.7.669 |