Capacitated multi-item lot-sizing problems with time windows
成果类型：
Article
署名作者：
Brahimi, Nadjib; Dauzere-Peres, Stephane; Najid, Najib M.
署名单位：
Centre National de la Recherche Scientifique (CNRS); IMT - Institut Mines-Telecom; IMT Atlantique; Nantes Universite; Ecole Centrale de Nantes; IMT - Institut Mines-Telecom; Mines Saint-Etienne; Centre National de la Recherche Scientifique (CNRS)
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1060.0325
发表日期：
2006
页码：
951-967
关键词：
摘要：
This research concerns a new family of capacitated multi-item lot-sizing problems, namely, lot-sizing problems with time windows. Two classes of the problem are analyzed and solved using different Lagrangian heuristics. Capacity constraints and a subset of time window constraints are relaxed resulting in particular single-item time window problems that are solved in polynomial time. Other relaxations leading to the classical Wagner-Whitin problem are also tested. Several smoothing heuristics are implemented and tested, and their results are compared. The gaps between lower and upper bounds for most problems are very small (less than 1%). Moreover, the proposed algorithms are robust and do not seem to be too affected when different parameters of the problem are varied.