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: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.