Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem"

Wolfgang Bruggemann and Hermann Jahnke
Additional contact information
Wolfgang Bruggemann: Institut fur Logistik und Transport, Universitat Hamburg, 20146 Hamburg, Germany
Hermann Jahnke: Wirtschaftswissenschaftliche Fakultat, Universitat Bielefeld, 33615 Bielefeld, Germany

Management Science, 1997, vol. 43, issue 1, 122-122

Abstract: Saloman et al. (Salomon, M., L. G. Kroon, R. Kuik, L. N. Van Wassenhove. 1991. Some extensions of the discrete lotsizing and scheduling problem. Management Sci. 37 801--812.) claim the NP-completeness of different variants of the discrete lot-sizing and scheduling problem (DLSP) which are differentiated by using a six-field notation. However, some of the given proofs are incorrect because the transformations employed map certain data values of the preimage problem to the number of data in the resulting instance and are hence not polynomial. As an example, we concentrate here on the 1/*/SI/G/A-optimization problem (Salomon et al. [Salomon, M., L. G. Kroon, R. Kuik, L. N. Van Wassenhove. 1991. Some extensions of the discrete lotsizing and scheduling problem. Management Sci. 37 801--812.], Theorem 3). Similar arguments pertain to the 1/*/A/G/SI-DLSP, too.

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.43.1.122 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:43:y:1997:i:1:p:122-122

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().