A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms
We consider a general class of scheduling problems where a set of conflicting jobs needs to be scheduled (preemptively or non-preemptively) on a set of machines so as to minimize the weighted sum of completion times. The conflicts among the jobs are formed as an arbitrary conflict graph. Building on the framework of Queyranne and Sviridenko (J. of Scheduling, 5:287-305, 2002 ), we present a general technique for reducing the weighted sum of completion times problem to the classical makespandoi:10.1145/1328911.1328922 fatcat:w2xdn36v6jax5fuywex6ozwlda