Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem"
Computational complexity results provide guideposts toward fruitful directions in algorithmic research and therefore play an important role in research on algorithm design. This note discusses complexity analysis in the context of lotsizing and scheduling problems. Such discussion is warranted for three reasons. First, research on problems that combine lotsizing and scheduling is growing rapidly. Second, these problems have the potential for requiring much less information to represent an instance than to represent a candidate solution. As a consequence, analysis may depend critically on subtle considerations relating to instance and solution size. Third, as we will see below, there is some evidence that the literature is unclear on this point.
Volume (Year): 45 (1999)
Issue (Month): 5 (May)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:5:p:768-769. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.