Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1024979501350 | Journal of Mathematical Modelling and Algorithms |
Keywords | Field | DocType |
production planning, DLSP, problem complexity, philosophy of modeling | Computational problem,Mathematical optimization,Job shop scheduling,Computer science,Minimal model,Counting problem,Production planning,Complete,Equivalence class,Computational complexity theory | Journal |
Volume | Issue | ISSN |
2 | 2 | 1572-9214 |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wolfgang Brüggemann | 1 | 10 | 1.05 |
| Kathrin Fischer | 2 | 1 | 0.35 |
| hermann jahnke | 3 | 35 | 3.77 |