Skip to main content
SpringerLink
Log in

On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

Abstract

We consider the problem of scheduling n independent multi- processor 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.

Supported in part by DFG — Graduiertenkolleg “Effiziente Algorithmen und Mehrskalenmethoden” and by 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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Millis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, Proceedings 40th IEEE Symposium on Foundations of Computer Science (1999), 32–43.

    Google Scholar 

  2. F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen, C. Kenyon, Scheduling to minimize the average completion time of dedicated tasks, Proceedings 20th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1974, Springer Verlag (2000), 454–464.

    Chapter  Google Scholar 

  3. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings 5th European Symposium on Algorithms, LNCS 1284, Springer Verlag (1997), 1–12.

    Google Scholar 

  4. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir, On chromatic sums and distributed resource allocation, Information and Computation 140 (1998), 183–202.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Bar-Noy and M. M. Halldórsson and G. Kortsarz and R. Salman and H. Shachnai, Sum multicoloring of graphs, Proceedings 7th European Symposium on Algorithms, LNCS 1643, Springer Verlag (1999), 390–401.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. X. Cai, C.-Y. Lee, and C.-L. Li, Minimizing total completion time in two-processor task systems with prespecified processor allocation, Naval Research Logistics 45 (1998), 231–242.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Chakrabarti, C. A. Philips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, Proceedings 23rd International Colloquium on Automata, Languages and Programming, LNCS 1099, Springer Verlag (1996), 646–657.

    Google Scholar 

  9. M. Drozdowski, Scheduling multiprocessor tasks-an overview, European Journal on Operations Research, 94 (1996), 215–230.

    Article  MATH  Google Scholar 

  10. U. Feige and J. Kilian, Zero-knowledge and the chromatic number, in Journal of Computer and System Science 57(2) (1998), 187–199.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  12. R. L. Graham, E. L. Lawler, J. K. Lenstra, K. Rinnooy Kan, Optimization and approximation in deterministic scheduling: a survey, Annals of Discrete Mathematics 5 (1979), 287–326.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to minimize average time: Offline and online algorithm, Mathematics of Operation Research 22 (1997), 513–544.

    Article  MATH  MathSciNet  Google Scholar 

  14. J. A. Hoogeveen, S. L. Van de Velde, and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259–272.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Skutella and G. J. Woeginger, A PTAS for minimizing the weighted sum of job completion times on parallel machines, Proceedings 31st ACM Symposium on Theory of Computing (1999), 400–407.

    Google Scholar 

  16. W. E. Smith, Various optimizers for single-stage production, Naval Research Logistic Quarterly 3 (1956), 59–66.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstrasse 40, 24 098, Kiel, Germany

    Aleksei V. Fishkin & Klaus Jansen

  2. PricewaterhouseCoopers, Applied Decision Analysis, 1 Embankment Place, London, WC2N 6RH, UK

    Lorant Porkolab

Authors
  1. Aleksei V. Fishkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lorant Porkolab
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, C/Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  2. Computer Technology Institute (CTI), University of Patras, 61 Riga Feraiou street, 26221, Patras, Greece

    Paul G. Spirakis

  3. Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fishkin, A.V., Jansen, K., Porkolab, L. (2001). On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation