A heuristic approach for big bucket multi-level production planning problems

被引：80

作者：

Akartunali, Kerem ^{[1
]}

Miller, Andrew J. ^{[1
]}

机构：

[1] Univ Wisconsin, Madison, WI 53706 USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 193卷 / 02期

基金：

美国国家科学基金会;

关键词：

Integer programming; Production planning; Heuristics; Relax-and-fix; Strong formulations; LOT-SIZING PROBLEMS; SETUP TIMES; ALGORITHMS; COSTS; SYSTEMS; MODELS;

D O I：

10.1016/j.ejor.2007.11.033

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：396 / 411

页数：16

共 42 条

[1] OPTIMAL LOT-SIZING ALGORITHMS FOR COMPLEX PRODUCT STRUCTURES [J].