Given a set of operations specified by their execution time intervals {[ai,zi)|i=1, ..., n}, where ai<zi, a processor-optimal allocation (POA) problem is to allocate the minimum number of processors to execute these operations, where any two operations [aj,zj) and [ak,zk) executed by a processor have the property of either zj≤ak or zk≤aj. A weighted version of the POA problem is to find a proce...