Complexity of the multi-product capacitated lot sizing problem(CLSP) with pricing(<Special Issue>Variational Inequality and Combinatorial Problems)

スポンサーリンク

概要

• 論文の詳細を見る

• We study the computational complexity of the multi product capacitated lot-sizing problem with pricing. It has been observed that the introduction of prices in the CLSP seems to make the problem computationally easier. The purpose of this paper is to show that even with the introduction of prices the problem is still NP-Hard.

• バイオメディカル・ファジィ・システム学会の論文

著者

• GONZALEZ-RAMIREZ Rosa

  Escuela de Ingenieria Industrial, Pontificia Universidad Catolica de Valparaiso

• SMITH Neale

  Quality and Manufacturing Center, Tecnologico de Monterrey

• GATICA Ricardo

  Escuela de Ingenieria Industrial, Pontificia Universidad Catolica de Valparaiso

関連論文

• Complexity of the multi-product capacitated lot sizing problem(CLSP) with pricing(Variational Inequality and Combinatorial Problems)

スポンサーリンク