Skip to main content
Log in

Distribution of a Heterogeneous Set of Resources in Multiprocessor Scheduling

  • SYSTEMS ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

We consider the problem of compiling a multiprocessor schedule for a complex of works in the presence of resources of two types: renewable (processors) and nonrenewable. The amount of resources available may change over time. The works are characterized by volumes and directive intervals. Parallel execution of work by several processors is allowed. The following tasks are solved: existence and construction of an admissible schedule for the given amount of resources; minimization of the cost of resources in the presence of which there is an admissible schedule.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1.
Fig. 2.

Similar content being viewed by others

REFERENCES

  1. D. T. Phillips and A. Garcia-Diaz, Fundamentals of Network Analysis (Prentice Hall, Englewood Cliffs, NJ, 1981).

    MATH  Google Scholar 

  2. E. G. Davydov, Operations Research (Vyssh. Shkola, Moscow, 1990) [in Russian].

  3. V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Schedule Theory. Single Stage Systems (Nauka, Moscow, 1984) [in Russian].

    Google Scholar 

  4. P. Brucker, Scheduling Algorithms (Heidelberg, Springer (2007).

    MATH  Google Scholar 

  5. A. A. Lazarev, Schedule Theory. Estimation of the Absolute Error and a Scheme for the Approximate Solution of Problems in Scheduling Theory (MFTI, Moscow, 2008) [in Russian].

    Google Scholar 

  6. A. V. Mishchenko and B. G. Sushkov, Minimization of the Execution Time of Works Represented by the Network Model, with Non-Fixed Network Parameters (VTs AN SSSR, Moscow, 1980), pp. 3–16 [in Russian].

  7. Yu. E. Malashenko and N. M. Novikova, “Analysis of multiuser network systems, taking into account uncertainty,” J. Comput. Syst. Sci. Int. 37, 292 (1998).

    MATH  Google Scholar 

  8. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 1,” J. Comput. Syst. Sci. Int. 32 (6), 1–11 (1994).

    MathSciNet  MATH  Google Scholar 

  9. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 2,” J. Comput. Syst. Sci. Int. 33 (3), 107–116 (1995).

    MathSciNet  MATH  Google Scholar 

  10. A. A. Mironov, T. A. Levkina, and V. I. Tsurkov, “Minimax estimations of arc weights in integer networks with fixed node degrees,” Appl. Comput. Math. 8, 216–226 (2009).

    MathSciNet  MATH  Google Scholar 

  11. A. A. Mironov and V. I. Tsurkov, “Class of distribution problems with minimax criterion,” Dokl. Akad. Nauk 336, 35–38 (1994).

    MathSciNet  Google Scholar 

  12. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms (Springer, Berlin, 2006).

    MATH  Google Scholar 

  13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. G. Furugyan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Furugyan, M.G. Distribution of a Heterogeneous Set of Resources in Multiprocessor Scheduling. J. Comput. Syst. Sci. Int. 60, 785–792 (2021). https://doi.org/10.1134/S1064230721050087

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230721050087

Navigation