Geodesic
A problem on the uniform assignment of jobs and its generalisation
Diskretnaya Matematika, Tome 13 (2001) no. 4, pp. 144-156.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the following assignment problem. During $m$ days $n$ worker should fulfil some amount of jobs, which is given by the vector $S=\{s_1,\ldots,s_m\}$ of the numbers of jobs for each day. The possibilities of each worker for each day are given by a $(0, 1)$-matrix $R$ of size $n\times m$, the prescribed assignments are given by a matrix $A$, the cost of jobs is given by a matrix $C$, and the desirable numbers of jobs for each worker is given by a vector $H=\{h_1,\ldots,h_n\}$. It is required to construct a matrix $X$ of assignments of jobs to workers such that the prescribed assignments are fulfilled and the matrix minimises the functional of uniformity, that is, the least square deviation of the assigned numbers of jobs from the desirable numbers of jobs for all workers provided that it minimises the cost of jobs $\sum_{i,j}^{n,m}c_{ij}x_{ij}$. We find a characteristic property of the uniform assignment, and with the use of this property construct an algorithm for solving the problem. 
@article{DM_2001_13_4_a10,
     author = {V. A. Kropanov and V. S. Rublev},
     title = {A problem on the uniform assignment of jobs and its generalisation},
     journal = {Diskretnaya Matematika},
     pages = {144--156},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2001_13_4_a10/}
}
TY  - JOUR
AU  - V. A. Kropanov
AU  - V. S. Rublev
TI  - A problem on the uniform assignment of jobs and its generalisation
JO  - Diskretnaya Matematika
PY  - 2001
SP  - 144
EP  - 156
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2001_13_4_a10/
LA  - ru
ID  - DM_2001_13_4_a10
ER  - 
%0 Journal Article
%A V. A. Kropanov
%A V. S. Rublev
%T A problem on the uniform assignment of jobs and its generalisation
%J Diskretnaya Matematika
%D 2001
%P 144-156
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2001_13_4_a10/
%G ru
%F DM_2001_13_4_a10
V. A. Kropanov; V. S. Rublev. A problem on the uniform assignment of jobs and its generalisation. Diskretnaya Matematika, Tome 13 (2001) no. 4, pp. 144-156. http://geodesic.mathdoc.fr/item/DM_2001_13_4_a10/

[1] Rublev V. S., Zadacha o ravnomernom raspredelenii rabot, Dep. v VINITI No611–V87

[2] Rublev V. S., “Zadacha o ravnomernom raspredelenii rabot”, Tezisy mezhdunarodnoi konferentsii «Matematicheskie metody v issledovanii operatsii», Sofiya, 1987, 46

[3] Rublev V. S., “Obobscheniya zadachi o ravnomernom raspredelenii rabot”, Tezisy dokladov yubileinoi nauchnoi konferentsii YarGU, Yaroslavl, 1995, 110–112

[4] Iensen P., Barnes D., Potokovoe programmirovanie, Radio i svyaz, Moskva, 1984 | Zbl