Question: partition problem reduction to the scheduling problem defined below. scheduling In: A number of processors m N, a (finite) set of tasks T where each
partition problem reduction to the scheduling problem defined below.
scheduling
In: A number of processors m N, a (finite) set of tasks T where each task x T has an associated duration d(x) N, and a positive integer D.
Q: Is it possible to partition the set T into m parts T1, . . . , Tm (i.e., pairwise disjoint sets covering T) such that P xTi d(x) D for every 1 i m?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
