Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2003: Algorithms and Computation pp 319–328Cite as

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates

  • Conference paper

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

Abstract

We consider the non-preemptive job shop scheduling problem with release dates and the average weighted completion time objective. We propose here a polynomial-time approximation scheme (PTAS) for the case when the number of machines is constant and each job consists of at most a constant number of operations. This substantially improves on previous results [4], adds to a number of techniques [1,2,6,10,22], and gives some answers to the questions mentioned in [20,23].

Supported by EU-project CRESCCO, IST-2001-33135, by EU-project APPOL I & II, IST-1999-14084, IST-2001-32007, by SNSF project 21-55778.98, and grant HPRN-CT-1999-00106.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Afrati, F., Bampis, E., Fishkin, A.V., Jansen, K., Kenyon, C.: Scheduling to minimize the average completion time of dedicated tasks. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 454–464. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Afrati, F., Milis, I.: Designing PTASs for MIN-SUM scheduling problems. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 432–444. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 646–657. Springer, Heidelberg (1996)

    Google Scholar 

  5. Chekuri, C.: Approximation algorithms for scheduling problems. PhD thesis, Department of Computer Science, Stanford University (1998)

    Google Scholar 

  6. Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 848–861. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. In: Proceedings of 8th Annual ACM-SIAM Symposium on discrete Algorithms, pp. 609–618 (1997)

    Google Scholar 

  8. Chen, B., Potts, C.N., Woeginger, G.J.: Handbook of combinatorial optimization. In: Du, D.-Z., Paradalos, P.M. (eds.) Chapter A review of machine scheduling: complexity, algorithms and approximability, pp. 21–169. Kluwer, Dordrecht (1998)

    Google Scholar 

  9. Fishkin, A.V., Jansen, K., Mastrolilli, M.: Grouping techniques for scheduling problems: Simpler and faster. In: Proceedings 9th Annual European Symposium, Arhus. LNCS, vol. 2161, pp. 206–217. Springer, Heidelberg (2001)

    Google Scholar 

  10. Fishkin, A.V., Jansen, K., Porkolab, L.: On minimizing average weighted completion time of multiprocessor tasks with release dates. In: Proceedings 28th International Colloquium on Automata, Languages and Programming, Crete. LNCS, vol. 2076, pp. 875–886. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  12. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operation Research 1, 117–129 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  13. Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. In: Proceedings 8th Symposium on Discrete Algorithms, pp. 599–608 (1997)

    Google Scholar 

  14. Gonzales, T., Sahni, S.: Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26, 36–52 (1978)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average time: Off-line and on-line algorithm. Mathematics of Operation Research, 513–544 (1997)

    Google Scholar 

  17. Hoogeveen, H., Schuurman, P., Weoginger, G.: Non-approximability results for scheduling problems with minsum criteria. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 353–366. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Jansen, K., Solis-Oba, R., Sviridenko, M.: Makespan minimization in job shops: A polynomial time approximation scheme. In: Proceedings 31st Annual ACM Symposium on Theory of Computing, pp. 394–399, Atlanta (1999) (To appear in SIAM Journal on Discrete Mathematics)

    Google Scholar 

  19. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Logistics of Production and Inventory. Handbooks in Operation Research and Management Science, chapter Sequencing and scheduling: Algorithms and complexity, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)

    Book  Google Scholar 

  20. Queyranne, M., Sviridenko, M.: New and improved algorithms for minsum shop scheduling. In: Proceedings 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 871–878 (2000)

    Google Scholar 

  21. Schulz, A.S.: Polytopes and scheduling. PhD thesis, Technical University of Berlin, Germany (1996)

    Google Scholar 

  22. Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2, 203–213 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2, 203–213 (2000)

    Article  MathSciNet  Google Scholar 

  24. Schuurman, P., Woeginger, G.J.: Approximation schemes – a tutorial. To appear in the book Lectures on Scheduling, edited by Moehring, R.H., Potts, C.N., Schulz, A.S., Woeginger, G.J., Wolsey, L.A. (2002)

    Google Scholar 

  25. Shmoys, D.B.: Using linear programming in the design and analysis of approximation algorithms: Two illustrative examples. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 15–32. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Shmoys, D.B., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM Journal of Computing 23, 617–632 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  27. Skutella, M.: Approximation and randomization in scheduling. PhD thesis, Technical University of Berlin, Germany (1998)

    Google Scholar 

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

    Article  Google Scholar 

  29. Torng, E., Uthaisombut, P.: Lower bounds for SRPT-subsequence algorithms for non-preemptive scheduling. In: Proceedings 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 973–974 (1999)

    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, 24118, Kiel, Germany

    Aleksei V. Fishkin & Klaus Jansen

  2. IDSIA-Istituto Dalle Molle di Studi sull’Intelligenza Artificiale, Manno, Switzerland

    Monaldo Mastrolilli

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. Monaldo Mastrolilli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fishkin, A.V., Jansen, K., Mastrolilli, M. (2003). On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates . In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation