A LAGRANGEAN RELAXATION APPROACH FOR VERY-LARGE-SCALE CAPACITATED LOT-SIZING

被引：73

作者：

DIABY, M

BAHL, HC

KARWAN, MH

ZIONTS, S

机构：

[1] CALIF STATE UNIV CHICO,COLL BUSINESS,CHICO,CA 95929

[2] SUNY BUFFALO,DEPT IND ENGN,BUFFALO,NY 14260

[3] SUNY BUFFALO,SCH MANAGEMENT,BUFFALO,NY 14260

来源：

MANAGEMENT SCIENCE | 1992年 / 38卷 / 09期

关键词：

INVENTORY PRODUCTION DETERMINISTIC MODELS; INVENTORY PRODUCTION MATERIAL REQUIREMENTS PLANNING; PROGRAMMING LARGE SCALE SYSTEMS;

D O I：

10.1287/mnsc.38.9.1329

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products and several thousand 0/1 integer variables can be solved in a reasonable amount of computer time to within one percent of their optimal solution. The proposed procedure is general enough to be applied directly or with slight modification to real-life production problems.

引用

页码：1329 / 1340

页数：12

共 43 条

[31]

JOHNSON LA, 1974, OPERATIONS RES PRODU, P201

[32] A HEURISTIC ALGORITHM FOR THE MULTI-ITEM LOT-SIZING PROBLEM WITH CAPACITY CONSTRAINTS [J].