Article

Scheduling to Minimize the Average Completion Time of Dedicated Tasks

Authors:

Claire KenyonAuthors Info & Claims

FST TCS 2000: Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science

Pages 454 - 464

Published: 13 December 2000 Publication History

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|fix_j|+C_j. In addition we give a polynomial time approximation scheme for the weighted preemptive problem with release dates, Pm|fix_j, pmtn, r_j|+w_jC_j.

References

[1]

F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, 40th Annual Symposium on Foundations of Computer Science (FOCS'99), 1999, 32-43.

Crossref

Google Scholar

[2]

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.

Crossref

Google Scholar

[3]

P. Brucker, A. Krämer, Polynomial algorithms for resource constrained and multiprocessor task scheduling problems, European Journal of Operational Research, 90 (1996) 214-226.

Google Scholar

[4]

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.

Google Scholar

[5]

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.

Google Scholar

[6]

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.

Crossref

Google Scholar

[7]

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.

Google Scholar

Cited By

View all

Chrétien SNicod JPhilippe LRehn-Sonigo VToch L(2015)Using a sparse promoting method in linear programming approximations to schedule parallel jobsConcurrency and Computation: Practice & Experience10.1002/cpe.335027:14(3561-3586)Online publication date: 25-Sep-2015
https://dl.acm.org/doi/10.1002/cpe.3350
Chretien SNicod JPhilippe LRehn-Sonigo VToch L(2012)Job scheduling using successive linear programming approximations of a sparse modelProceedings of the 18th international conference on Parallel Processing10.1007/978-3-642-32820-6_14(116-127)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32820-6_14
Halldórsson MKortsarz GSviridenko M(2011)Sum edge coloring of multigraphs via configuration LPACM Transactions on Algorithms10.1145/1921659.19216687:2(1-21)Online publication date: 31-Mar-2011
https://dl.acm.org/doi/10.1145/1921659.1921668
Show More Cited By

Index Terms

Scheduling to Minimize the Average Completion Time of Dedicated Tasks
1. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis
      1. Approximation
    2. Numerical analysis
      1. Computations on polynomials
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Index terms have been assigned to the content through auto-classification.

Recommendations

Approximation Techniques for Average Completion Time Scheduling

We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem based ...
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the job completion times. For a variety of scheduling ...
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

In this paper, we study a new primary-secondary bicriteria scheduling problem on identical machines. The primary objective is to minimize the total completion time of all jobs and the secondary objective is to minimize the maximum T-time of all machines,...

Comments

Information & Contributors

Information

Published In

FST TCS 2000: Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science

December 2000

530 pages

ISBN:3540414134

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 December 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chrétien SNicod JPhilippe LRehn-Sonigo VToch L(2015)Using a sparse promoting method in linear programming approximations to schedule parallel jobsConcurrency and Computation: Practice & Experience10.1002/cpe.335027:14(3561-3586)Online publication date: 25-Sep-2015
https://dl.acm.org/doi/10.1002/cpe.3350
Chretien SNicod JPhilippe LRehn-Sonigo VToch L(2012)Job scheduling using successive linear programming approximations of a sparse modelProceedings of the 18th international conference on Parallel Processing10.1007/978-3-642-32820-6_14(116-127)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32820-6_14
Halldórsson MKortsarz GSviridenko M(2011)Sum edge coloring of multigraphs via configuration LPACM Transactions on Algorithms10.1145/1921659.19216687:2(1-21)Online publication date: 31-Mar-2011
https://dl.acm.org/doi/10.1145/1921659.1921668
Halldórsson MKortsarz GSviridenko M(2008)Min sum edge coloring in multigraphs via configuration LPProceedings of the 13th international conference on Integer programming and combinatorial optimization10.5555/1788814.1788847(359-373)Online publication date: 26-May-2008
https://dl.acm.org/doi/10.5555/1788814.1788847
Gandhi RHalldórsson MKortsarz GShachnai H(2008)Improved bounds for scheduling conflicting jobs with minsum criteriaACM Transactions on Algorithms10.1145/1328911.13289224:1(1-20)Online publication date: 28-Mar-2008
https://dl.acm.org/doi/10.1145/1328911.1328922
Afrati FMilis I(2006)Designing PTASs for MIN-SUM scheduling problemsDiscrete Applied Mathematics10.5555/1141038.1705262154:4(622-639)Online publication date: 15-Mar-2006
https://dl.acm.org/doi/10.5555/1141038.1705262
Dutot PEyraud LMounié GTrystram DGibbons PAdler M(2004)Bi-criteria algorithm for scheduling jobs on cluster platformsProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007932(125-132)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007932
Gandhi RHalldórsson MKortsarz GShachnai H(2004)Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteriaProceedings of the Second international conference on Approximation and Online Algorithms10.1007/978-3-540-31833-0_8(68-82)Online publication date: 14-Sep-2004
https://dl.acm.org/doi/10.1007/978-3-540-31833-0_8

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Approximation Techniques for Average Completion Time Scheduling

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations