Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives
本文证明了具有资源约束的单机调度问题与经典两机流水车间调度问题在正则目标下等价，并给出了新的NP困难性证明，细化了该问题的计算复杂性分类。
A number of results have been reported in the literature for a single machine job scheduling problem with resource constraints. We demonstrate that many of these results and some new results follow from an equivalence of this problem and the classical two-machine flow-shop scheduling problem. We further refine computational complexity of the problem with resource constraints by presenting new NP-hardness proofs.