Skip to main content
SpringerLink
Log in

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

In this paper we give a polynomial algorithm for the problem P | r i , p i =p, pmtn | ∑ C i . This result is applied to derive a polynomial algorithm for the problem O | r i , p ij =1| ∑ C i .

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Baptiste, P., Brucker, P.: Scheduling Equal Processing Time Jobs: A Survey. In: Leung, Y.T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 78–96. CRC Press LLC, Boca Raton (2004)

    Google Scholar 

  2. Brucker, P., Jurisch, B., Jurisch, M.: Open shop problems with unit time operations. Z. Oper. Res. 37, 59–73 (1993)

    MATH  MathSciNet  Google Scholar 

  3. Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Berlin (2001)

    MATH  Google Scholar 

  4. Chvatal, V.: Linear programming. Freeman, New York (1983)

    MATH  Google Scholar 

  5. Du, J., Leung, J.Y.-T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoretical Computer Science 75, 347–355 (1990)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Math 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Herrbach, L.A., Leung, J.Y.-T.: Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. Operations Research 38, 487–494 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kravchenko, S.A.: On the complexity of minimizing the number of late jobs in unit time open shop. Discrete Applied Mathematics 100, 127–132 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Leung, J.Y.-T., Young, G.H.: Preemptive scheduling to minimize mean weighted flow time. Information Processing Letters 34, 47–50 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)

    MATH  Google Scholar 

  12. McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959/1960)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mokotoff, E.: Parallel machine scheduling problem: survey. Asia-Pacific Journal of Operational Research 18, 193–242 (2001)

    MATH  MathSciNet  Google Scholar 

  14. Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)

    MATH  Google Scholar 

  15. Tautenhahn, T., Woeginger, G.J.: Minimizing the total completion time in a unittime open shop with release times. Operations Research Letters 20, 207–212 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Brucker

  2. United Institute of Informatics Problems, Surganova St. 6, 220012, Minsk, Belarus

    Svetlana A. Kravchenko

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svetlana A. Kravchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brucker, P., Kravchenko, S.A. (2005). Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_21

Download citation

  • DOI: https://doi.org/10.1007/11424925_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation