A lot-sizing problem in an automated foundry

被引：32

作者：

dos Santos-Meza, E

dos Santos, MO

Arenales, MN

机构：

[1] Univ Sao Paulo, Inst Ciencias Matemat & Computacao, Dept Ciencias Computacao & Estatist, BR-13560970 Sao Carlos, SP, Brazil

[2] Univ Estadual Ponta Grossa, Dept Matemat & Estatist, Campus Uvaranas,Bloco L, BR-84030000 Ponta Grossa, PR, Brazil

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2002年 / 139卷 / 03期

基金：

巴西圣保罗研究基金会;

关键词：

linear and integer programming; lot sizing; scheduling;

D O I：

10.1016/S0377-2217(01)00196-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This work consists of the study of a foundry which has only one furnace and several moulding machines producing a known demand of different types of items which can be made of different alloys. There are two important and linked decision levels in this foundry: (1) what alloys should be produced in the furnace in each period, and (2) the quantity of items to be produced in each moulding machine. Two different cases are highlighted here: a single alloy can produce all the items, and different alloys are needed to produce the items. Assuming that the production bottleneck is the furnace, efficient problem-specific solution methods are proposed. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：490 / 500

页数：11