Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’

0.00 Avg rating—0 Votes

Article ID:	iaor1998753
Country:	United States
Volume:	43
Issue:	1
Start Page Number:	122
End Page Number:	122
Publication Date:	Jan 1997
Journal:	Management Science
Authors:	Brggemann Wolfgang, Jahnke Hermann
Keywords:	production, computational analysis

Abstract:

Salomon et al. claim the NP-completeness of different variants of the discrete lot-sizing and scheduling problem 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.

Reviews

Required fields are marked *. Your email address will not be published.