期刊
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
卷 31, 期 5, 页码 365-378出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0483(03)00059-8
关键词
capacitated lot sizing problem; heuristics; integer programming; production planning
Lot sizing is one of the most important and also one of the most difficult problems in production planning. This subject has been studied extensively in the literature. In this article, we consider single-level lot sizing problems, their variants and solution approaches. After introducing factors affecting formulation and the complexity of production planning problems, and introducing different variants of lot sizing and scheduling problems, we discuss single-level lot sizing problems, together with exact and heuristic approaches for their solution. We conclude with some suggestions for future research. (C) 2003 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据