Optimal scheduling of products with two subassemblies on a single machine.

We consider a single-machine job-shop in which subassemblies of two different types are made and then assembled into products. The time required for each type is known. A fixed set-up cost is incurred whenever the machine is switched over from one type to the other. We describe and analyze an efficient algorithm for minimizing the mean ready (or flow) time of the products. Applications to the automated manufacture of circuit boards are noted.