Geodesic
Successive partition of edges of bipartite graph into matchings
Diskretnaya Matematika, Tome 28 (2016) no. 1, pp. 78-86

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

It is assumed that the input data for scheduling a set of customers are given as a bipartite graph in some system of units. We consider the problem of composing a schedule of smallest length under the condition of continuous work with no downtime of each unit and their simultaneous actuation. Conditions are obtained for a partition of the edge set of a graph into matchings to form a schedule of the required form.
Keywords: graph, schedule, bipartite graph, matching, queuing. 
@article{DM_2016_28_1_a3,
     author = {A. M. Magomedov and T. A. Magomedov},
     title = {Successive partition of edges of bipartite graph into matchings},
     journal = {Diskretnaya Matematika},
     pages = {78--86},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2016_28_1_a3/}
}
TY  - JOUR
AU  - A. M. Magomedov
AU  - T. A. Magomedov
TI  - Successive partition of edges of bipartite graph into matchings
JO  - Diskretnaya Matematika
PY  - 2016
SP  - 78
EP  - 86
VL  - 28
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2016_28_1_a3/
LA  - ru
ID  - DM_2016_28_1_a3
ER  - 
%0 Journal Article
%A A. M. Magomedov
%A T. A. Magomedov
%T Successive partition of edges of bipartite graph into matchings
%J Diskretnaya Matematika
%D 2016
%P 78-86
%V 28
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2016_28_1_a3/
%G ru
%F DM_2016_28_1_a3
A. M. Magomedov; T. A. Magomedov. Successive partition of edges of bipartite graph into matchings. Diskretnaya Matematika, Tome 28 (2016) no. 1, pp. 78-86. http://geodesic.mathdoc.fr/item/DM_2016_28_1_a3/