A ONE-DIMENSIONAL CUTTING STOCK PROBLEM IN THE ALUMINUM-INDUSTRY AND ITS SOLUTION

被引：60

作者：

STADTLER, H

机构：

[1] Am Pfeilshof 35b

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 44卷 / 02期

关键词：

linear programming; One-dimensional cutting stock problem;

D O I：

10.1016/0377-2217(90)90356-G

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

When producing window frames made out of aluminium one faces the decision problem to determine how many aluminium profiles of a given standard length have to be bought to fulfill production requirements. As results of the currently implemented First Fit Decreasing (FFD) heuristic were regarded unsatisfactorily, a new code-based on the column generation procedure of Gilmore and Gomory-has been developed and supplemented by a one-pass branching up procedure to achieve integrality. Algorithmic details about the integrality achievement phase as well as results obtained when solving real world cutting stock problems on a personal computer are provided. © 1990.

引用

页码：209 / 223

页数：15

共 13 条

[1]

Coffman E. G., 1984, APPROXIMATION ALGORI, P49, DOI DOI 10.1007/978-3-7091-4338-4

[2]

DIEGEL A, 1988, 9 EUR TIMS 28 JOINT

[3]

Garey M. R., 1981, APPROXIMATION ALGORI, P147

[4] INTEGER PROGRAMMING ALGORITHMS - FRAMEWORK AND STATE-OF-ART SURVEY [J].