Abstract

We consider a model which deals with the fabrication of products at a single facility for later assembly into end products. Each product requires several part types: one unique part and others that are common to all the products. Also each production batch requires a setup. Baker provides a dynamic programming algorithm to determine a production schedule for minimizing the mean completion time for the case where each product requires only two part types: one unique and the other which is common to all products. In this paper we extend his analysis to our more general case.