Options
Problems, Models and Complexity. Part II: Application to the DLSP
Publikationstyp
Journal Article
Date Issued
2003
Sprache
English
TORE-URI
Volume
2
Issue
2
Start Page
153
End Page
169
Citation
Journal of Mathematical Modelling and Algorithms 2 (2): 153-169 (2003-12-01)
Publisher DOI
Publisher
Springer Science + Business Media B.V.
In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.Publishers.
Subjects
DLSP
philosophy of modeling
problem complexity
production planning
DDC Class
330: Wirtschaft
600: Technik