Scheduling: Agreement graph vs resource constraints

• The complexity of SWA is closed for m = 2 and at most two values of processing times.
• Resource-constrained scheduling is sNP-hard for m = 2 and pi∈{a,2a+b}pi∈{a,2a+b} with b ≠ 0 and b≠-a.
• Resource-constrained scheduling: two machines, pi∈{a,2a}pi∈{a,2a} is polynomial.
• Another polynomial case for resource-constrained scheduling is presented.
• Resource-constrained scheduling: two machines, pi∈{1,2},ri∈{0,r} is strongly NP-hard.

We investigate two scheduling problems. The first is scheduling with agreements (SWA) that consists in scheduling a set of jobs non-preemptively on identical machines in a minimum time, subject to constraints that only some specific jobs can be scheduled concurrently. These constraints are represented by an agreement graph. We extend the NP-hardness of SWA with three distinct values of processing times to only two values and this definitely closes the complexity status of SWA on two machines with two fixed processing times. The second problem is the so-called resource-constrained scheduling. We prove that SWA is polynomially equivalent to a special case of the resource-constrained scheduling and deduce new complexity results of the latter.