4.7 Article

A lot-sizing problem in an automated foundry

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 139, Issue 3, Pages 490-500

Publisher

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

Keywords

linear and integer programming; lot sizing; scheduling

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available