Abstract
We formulate a problem dealing with the manufacture of components at a single facility for subsequent assembly into end products. Each product requires both unique components and common components, and each production batch requires a setup. An optimal schedule for mean completion time is found by means of an algorithm which combines a sequencing procedure and a dynamic programming procedure.

This publication has 3 references indexed in Scilit: