Scheduling under a non-renewable resource constraint

This paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitrary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson’s algorithm. Immediate extensions of this result are presented.