An N-Product, Multi-Machine, Lotsize Scheduling Model
- 1 September 1973
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 5 (3) , 237-244
- https://doi.org/10.1080/05695557308974907
Abstract
In this paper we consider an N-product, multi-machine, lotsize-scheduling problem that was originally encountered in a large automotive metal stamping facility. It is shown that the natural constraints of the real-life problem provide a special structure which allows an efficient formulation of the problem as a 0–1 integer program. An implicit enumeration algorithm for obtaining numerical solutions is presented. Computational experience shows that the algorithm is quite efficient when the number of products does not exceed ten or eleven. In the automotive metal stamping facility, that number is rarely exceeded; therefore, it is possible to employ the model as one of the basic tools used by a team responsible for the development of a production planning system.Keywords
This publication has 4 references indexed in Scilit:
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- A Note on Economic Lot Sizes for Multi-Purpose EquipmentManagement Science, 1964
- Programming of Economic Lot SizesManagement Science, 1958