Skip to main content
SpringerLink
Log in

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

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

Abstract

The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines to remain idle.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chekuri, C., Bender, M.A.: An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms 41, 212–224 (2002)

    Article  MathSciNet  Google Scholar 

  2. Chudak, F.A., Shmoys, D.B.: Approximation algorithms for precedence constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms 30, 323–343 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Du, J., Leung, J.Y.T., Young, G.H.: Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation 92, 219–236 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gonzalez, T., Sahni, S.: Preemptive scheduling of uniform processor systems. Journal of the ACM 25, 92–101 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics 14, 67–92 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17, 539–551 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hu, T.C.: Parallel sequencing and assembly line problems. Operations Research 9, 841–848 (1961)

    Article  MathSciNet  Google Scholar 

  8. Kubiak, W., Penz, B., Trystram, D.: Scheduling chains on uniform processors with communication delays. Journal of Scheduling 5, 459–476 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. North Holland, Amsterdam

    Google Scholar 

  10. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Operations Research 26, 22–35

    Google Scholar 

  11. Woeginger, G.: A comment on scheduling uniform machines under chain-type precedence constraints. Operations Research Letters 26(3), 107–109 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität zu Kiel, Germany

    Klaus Jansen

  2. Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Solis-Oba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, TN 37996-3450, Knoxville, USA

    Jack Dongarra

  3. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Marcin Paprzycki

  4. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansen, K., Solis-Oba, R. (2004). Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation