SOLVING A CUTTING PROBLEM-BASED ON EXISTING PATTERNS

被引：8

作者：

ELOMRI, A ^{[1
]}

MOREL, P ^{[1
]}

PUN, L ^{[1
]}

DOUMEINGTS, G ^{[1
]}

机构：

[1] UNIV BORDEAUX 1,LAB GRAI,35 COURS LIBERAT,F-33405 TALENCE,FRANCE

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 77卷 / 01期

关键词：

CUTTING PROBLEM; CLOTHING INDUSTRY; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING;

D O I：

10.1016/0377-2217(94)90036-1

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we shall try to solve an industrial problem, namely: how to minimize the cutting cost of the fabric in the clothing industry. The paper is divided into three parts: Part 1: Statement of the problem; Part 2: Experimental efforts to identify the correct form of the economic function; Part 3: A combined linear/non-linear programming approach to reach a practical feasible solution.

引用

页码：169 / 178

页数：10

共 15 条

[1]

COSTA MC, 1982, RAIRO-RECH OPER, V16, P65

[2]

COSTA MC, 1984, RAIRO-RECH OPER, V18, P211

[3]

ELOMRI A, 1990, MEMOIRE DEA

[4] MATHEMATICAL-PROGRAMMING MODELS FOR CUTTING-STOCK PROBLEMS IN THE CLOTHING INDUSTRY [J].

FARLEY, AA .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (01) :41-53

[5] APPROXIMATE SOLUTIONS FOR THE CUTTING STOCK PORTFOLIO PROBLEM [J].

GEMMILL, DD ;

SANDERS, JL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :167-174

[6] OPTIMAL-SOLUTIONS FOR THE CUTTING STOCK PROBLEM [J].

GOULIMIS, C .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :197-208

[7]

MINOUX M, 1983, PROGRAMMATION LINEAI, V2

[8]

MINOUX M, 1983, PROGRAMMATION LINEAR, V1

[9]

MOREAU G, 1973, THESIS LYON

[10] NEAR-OPTIMAL SOLUTIONS TO ONE-DIMENSIONAL CUTTING STOCK PROBLEMS [J].

ROODMAN, GM .

COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (06) :713-719

← 1 2 →