Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
