1 research outputs found
On the NP-hardness of scheduling with time restrictions
In a recent paper, Braun, Chung and Graham [1] have addressed a
single-processor scheduling problem with time restrictions. Given a fixed
integer , there is a set of jobs to be processed by a single
processor subject to the following B-constraint. For any real , no unit time
interval is allowed to intersect more than jobs. The problem has
been shown to be NP-hard when is part of the input and left as an open
question whether it remains NP-hard or not if is fixed [1, 5, 7]. This
paper contributes to answering this question that we prove the problem is
NP-hard even when . A PTAS is also presented for any constant