question archive Python] Assume that there are n tasks with integer processing times t1
Python] Assume that there are n tasks with integer processing times t1
Subject:Computer SciencePrice: Bought3
Python] Assume that there are n tasks with integer processing times t1.. tn that should be scheduled on two machines. Every task can be scheduled on either machine but not both. We want to minimize the total time by which all tasks are completed. Ideally the tasks can be scheduled so that the total processing time is equally divided. Show that determining if the processing time can be equally divided is NP-complete by reducing the subset sum problem to it.
