Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
On chromatic sums and distributed resource allocation
Information and Computation
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
ESA '99 Proceedings of the 7th 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
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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)
| Hi-index | 0.00 |
We consider the problem of scheduling n independent multiprocessor tasks with release dates on a fixed number of processors, where the objective is to compute a non-preemptive schedule minimizing the average weighted completion time. For each task, in addition to its processing time and release date, there is given a prespecified, dedicated subset of processors which are required to process the task simultaneously. We propose here a polynomial-time approximation scheme for the problem, making substantial improvement on previous results and following the recent developments [1, 2, 15] on approximation schemes for scheduling problems with the average weighted completion time objective.