Scheduling the production of two-component jobs on a single machine

In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific component, on a single machine. A set-up time is required before each batch of standard components is processed. A job is completed when both its standard and specific components have been processed and are available. Standard components only become available when the batch to which they belong is completed, whereas specific components are available on completion of their processing. We present results for two well-known due-date related criteria. In particular, an O(n²) dynamic programming algorithm is derived for the problem of minimising the maximum lateness. For minimising the number of late jobs, we show that the problem is NP-hard and give a dynamic programming algorithm that requires pseudo-polynomial time. Finally, we show that a variant of the number of late jobs problem, in which there is a common processing time for the standard components, is solvable in O(n⁴ log n) time.