| Article ID: | iaor20011219 |
| Country: | Netherlands |
| Volume: | 65 |
| Issue: | 3 |
| Start Page Number: | 295 |
| End Page Number: | 303 |
| Publication Date: | Jan 2000 |
| Journal: | International Journal of Production Economics |
| Authors: | Sierksma Gerard, Wanders Henrico L.T. |
| Keywords: | programming: linear |
The cardboard company Kappa Graphic Board produces several kinds of cardboard with various weights and thicknesses. If the thickness is above a certain value (namely 1.7 mm), the cardboard is composed of three layers which are glued together, and is called heavy weight cardboard. The three layers are produced on different machines; the production speed depends on the thickness of the layers. In this paper we restrict our analysis to heavy weight cardboard. The objective is to find a composition of the layers such that the throughput time is minimized. The problem is solved by means of an LP-model in which the objective function is a linearized working hours function; also a number of constraints are linearized. The results of the calculations indicate that it is possible to decrease the total number of working hours in the production process without a large increase of production costs.