Skip to main content
SpringerLink
Log in

Minimizing mean flow-time with parallel processors and resource constraints

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The problem to be considered is one of scheduling nonpreemptable tasks in multiprocessor systems when tasks need for their processing processors and other limited resources, and when mean flow time is the system performance measure. For each task the time required for its processing and the amount of each resource which it requires, are given. Special attention is paid to the computational complexity of algorithms for determining the optimal schedules for different assumptions concerning the environment. For the case of scheduling independent, arbitrary length tasks when each task may require a unit of an additional resource of one type, an O(n 3) algorithm is given. For more complicated resource requirements, however, it is proved that the problem under consideration is NP-hard in the strong sense, even for the case of two processors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Błażewicz, J.: Deadline scheduling of tasks with ready times and resource constraints. Inf. Proc. Lett. 8, 60–63 (1979)

    Article  MathSciNet  Google Scholar 

  2. Błażewicz, J.: Scheduling tasks on parallel processors under resource constraints to minimize mean finishing time. Methods Oper. Res. 35, 67–72 (1979)

    MATH  Google Scholar 

  3. Błażewicz, J., Barcelo, J., Kubiak, W., Röck, H.: Scheduling tasks on two processors with deadlines and additional resources. Eur. J. Oper. Res. 26, 364–370 (1986)

    Article  MathSciNet  Google Scholar 

  4. Błażewicz, J., Drabowski, M., Weglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. C-35, 389–393 (1986)

    Article  MathSciNet  Google Scholar 

  5. Błażewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Oper. Res. Lett. 2, 80–83 (1983)

    Article  MathSciNet  Google Scholar 

  6. Błażewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)

    Article  MathSciNet  Google Scholar 

  7. Bruno, J.L.: Scheduling algorithms for minimizing the mean weighted flow-time criterion. In: Computer and Job/Shop Scheduling Theory, Coffman, E.G., Jr. (ed.). New York: Wiley 1976

    Google Scholar 

  8. Bruno, J., Coffman, E.G., Jr., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17, 382–387 (1974)

    Article  MathSciNet  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4, 397–411 (1975)

    Article  MathSciNet  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. San Francisco: Freeman 1979

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Johnson, D.S.: The NP-completeness column; an ongoing guide. J. Algorithms 4, 189–203 (1983)

    Article  MathSciNet  Google Scholar 

  13. Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling theory since 1981: an annotated bibliography. In: M.O.H. Eighertaigh, J.K. Lenstra, A.H.G. Rinnooy Kan (eds.), Combinatorial Optimization: Annotated Bibliographies. Chichester: Wiley 1985

    MATH  Google Scholar 

  14. McNaughton, R.: Scheduling with deadlines and loss functions. Management Sci. 12, 1–12 (1959)

    Article  MathSciNet  Google Scholar 

  15. Möhring, R.H.: Scheduling problems with a singular solution. Ann. Discrete Math. 16, 225–339 (1982)

    MathSciNet  Google Scholar 

  16. Radermacher, F.J.: Kapazitätsoptimierung in Netzplänen. Mathematical Systems in Economics. Vol. 40. Meisenheim: Verlag Anton Hain 1978

    MATH  Google Scholar 

  17. Radermacher, F.J.: Scheduling of project networks. Ann. Oper. Res. 4, 227–252 (1985/86)

    Article  MathSciNet  Google Scholar 

  18. Röck, H.: Some new results in flow shop scheduling. Zeitschr. Oper. Res. 28, 1–16 (1984)

    MathSciNet  Google Scholar 

  19. Słowinski, R.: L'ordonnancement des tâches preémptives sur les processeurs indépendants en présense de ressources supplémentaires. RAIRO Inf. 15, 155–166 (1981)

    MATH  Google Scholar 

  20. Ullman, J.D.: Complexity of Sequencing Problems. In: Computer and Job/Shop Scheduling Theory. Coffman, E.G., Jr. (ed.). New York: Wiley 1976

    Google Scholar 

  21. De Werra, D.: Preemptive scheduling, linear programming and network flows. SIAM J. Algebraic Discrete Methods 5, 11–20 (1984)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Automatyki, Politechnika Poznańska, Poznań, Poland

    J. Błażewicz

  2. Instytut Informatyki, Politechnika Gdańska, Gdańsk, Poland

    W. Kubiak

  3. Institut für Quantitative Methoden, Technische Universität Berlin, Berlin

    H. Röck

  4. Universidade Federal de Rio de Janeiro, Rio de Janeiro, Brazil

    J. Szwarcfiter

Authors
  1. J. Błażewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Kubiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Röck
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Szwarcfiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Błażewicz, J., Kubiak, W., Röck, H. et al. Minimizing mean flow-time with parallel processors and resource constraints. Acta Informatica 24, 513–524 (1987). https://doi.org/10.1007/BF00263292

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263292

Keywords

Search

Navigation