4.7 Article

A lot-sizing problem in an automated foundry

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 139, 期 3, 页码 490-500

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(01)00196-5

关键词

linear and integer programming; lot sizing; scheduling

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据