This article is cited in 1 paper

Successive partition of edges of bipartite graph into matchings

A. M. Magomedov^a, T. A. Magomedov<sup>b

a</sup> Daghestan State University, Makhachkala
^b Twitter Inc.

Abstract: 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.

UDC: 519.177.3

Received: 24.12.2014

DOI: 10.4213/dm1358

 English version: Discrete Mathematics and Applications, 2016, 26:6, 347–353

Bibliographic databases:

• 
• 
• 
•