Abstract
The distribution problem of assignments among participants in the presence of constraints is considered. For each assignment participants are defined, whom this assignment can be transferred to, and participants who cannot take the given assignment. Some collections of assignments are marked as clusters, i.e., all assignments of each such cluster can be given up only to one participant; and clusters can be intersected. Estimates of the extremum are set out, an approximate algorithm of the solution is proposed. The problems of this type can be met with, for example, in multiprocessor computing complexes in the distribution of assignments among processors, in the distribution of jobs among executors, and in a number of other cases.
Similar content being viewed by others
References
Chentsov, P.A., Job Distribution Algorithms, Autom. Remote Control, 2006, no. 8, pp. 1251–1264.
Chentsov, P.A., On the Distribution Problem of Assignments among Participants with Constraints for Choice of Assignments, Vestn. Komp. Inf. Tekhnol., 2007, no. 7, pp. 52–56.
Chentsov, P.A., On Some Distribution Algorithms of Assignments Among Pariticipants, in Algoritmy i programmnye sredstva parallel’nykh vychislenii (Algorithms and Programmed Tools of Parallel Calculations), Yekaterinburg: Ross. Akad. Nauk, 2002, no. 6, pp. 231–241.
Girlikh, E., Kovalev, M.M., and Kotov, V.N., Algorithm for the Distribution Problem of Jobs Performed in Real Time in the Presence of Additional Information, Diskretn. Mat., 2003, no. 5, vol. 15, pp. 133–140.
Graham, R.L., Bounds for Certain Multiprocessor Anomalies, Bell Syst. Tech. J., 1966, vol. 45, pp. 1563–1581.
Graham, R.L., Bounds for Certain Multiprocessor Anomalies, SIAM J. Appl. Math., 1969, vol. 17, pp. 263–269.
Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NPCompleteness, San Francisco: Freeman, 1979. Translation under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Kovalev, M.M., Diskretnaya optimizatsiya (Discrete Optimization), Moscow: Editorial URSS, 2003.
Hall, M., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.
Chentsov, A.G. and Chentsov, P.A., Partitioning a Finite Set by Dynamic Programming Method, Autom. Remote Control, 2000, no. 4, pp. 658–670.
Chentsov, A.G. and Chentsov, P.A., Dynamic Programming in the Problem of Decomposition Optimization, Autom. Remote Control, 2002, no. 5, pp. 815–828.
Petrov, Yu.Yu., Application of the Genetic Algorithm with Probability Control of Genetic Operators in Solving the Problem of Packing in Containers, Sb. Nauchn. Tr. SevKavGTU, Ser. Estestvennonauchnaya, 2006, no. 2.
Author information
Authors and Affiliations
Additional information
Original Russian Text © P.A. Chentsov, 2011, published in Avtomatika i Telemekhanika, 2011, No. 8, pp. 121–135.
Rights and permissions
About this article
Cite this article
Chentsov, P.A. Distribution of assignments among participants under conditions of constraints. Autom Remote Control 72, 1690–1704 (2011). https://doi.org/10.1134/S0005117911080078
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117911080078