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.
Similar content being viewed by others
REFERENCES
D. T. Phillips and A. Garcia-Diaz, Fundamentals of Network Analysis (Prentice Hall, Englewood Cliffs, NJ, 1981).
E. G. Davydov, Operations Research (Vyssh. Shkola, Moscow, 1990) [in Russian].
V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Schedule Theory. Single Stage Systems (Nauka, Moscow, 1984) [in Russian].
P. Brucker, Scheduling Algorithms (Heidelberg, Springer (2007).
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].
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].
Yu. E. Malashenko and N. M. Novikova, “Analysis of multiuser network systems, taking into account uncertainty,” J. Comput. Syst. Sci. Int. 37, 292 (1998).
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).
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).
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).
A. A. Mironov and V. I. Tsurkov, “Class of distribution problems with minimax criterion,” Dokl. Akad. Nauk 336, 35–38 (1994).
B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms (Springer, Berlin, 2006).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230721050087