Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Maximizing the Throughput of Multiprocessor Tasks
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Job scheduling using successive linear programming approximations of a sparse model
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
We propose a polynomial time approximation scheme for scheduling a set of dedicated tasks on a constant number m of processors in order to minimize the sum of completion times Pm|fixj|+Cj. In addition we give a polynomial time approximation scheme for the weighted preemptive problem with release dates, Pm|fixj, pmtn, rj|+wjCj.