Abstract
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\left| {fix_j } \right|\sum {C_j } \) . In addition we give a polynomial time approximation scheme for the weighted preemptive problem with release dates, \( Pm\left| {fix_j pmtn,r_j } \right|\sum {w_j C_j } \) .
This research was partially supported by the ASP “Approximabilité et Recherche Locale” of the French Ministry of Education, Research and Technology (MENRT), by the DFG - Graduiertenkolleg “Effiziente Algorithmen und Mehrskalenmethoden” and by the EU project APPOL, “Approximation and on-line algorithms”, IST-1999-14084.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes forminimizing average weighted completion time with release dates, 40th Annual Symposiumon Foundations of Computer Science (FOCS’99), 1999, 32–43.
A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, How to schedule independent multiprocessor tasks, Proceedings of the 5th European Symposium on Algorithms(ESA’97), LNCS 1284, 1–12.
P. Brucker, A. Krämer, Polynomial algorithms for resource constrained and multi processortask scheduling problems, European Journal of Operational Research, 90(1996) 214–226.
X. Cai, C.-Y. Lee, C.-L. Li, Minimizing total completion time in two-processor task systems with prespecified processor allocations, Naval Research Logistics, 45 (1998)231–242.
R. L. Graham, E. L. Lawler, J. K. Lenstra, K. Rinnooy Kan, Optimization and Approximation in Deterministic Scheduling: A Survey, Annals Discrete Mathematics,5 (1979) 287–326.
J.A. Hoogeveen, S.L. van de Velde, B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics,55 (1994) 259–272.
J. Labetoulle, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W. R. Pulleyblank(ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984,245–261.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Bampis, E., Fishkin, A.V., Jansen, K., Kenyon, C. (2000). Scheduling to Minimize the Average Completion Time of Dedicated Tasks. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive