On the NP-hardness of scheduling with time restrictions

An Zhang, Yong Chen, Lin Chen +1

In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B\ge 2$, there is a set of jobs…