DEVELOPMENT OF A COMPUTATIONAL EXPERIMENT FOR THE PARALLELING OF THE MODIFIED BRANCH AND BOUND METHOD FOR THE PROBLEM FOR THE APPOINTMENT OF PROCEDURES TO PATIENTS IN SANATORIUM-Reference-Cited by-同舟云学术

DEVELOPMENT OF A COMPUTATIONAL EXPERIMENT FOR THE PARALLELING OF THE MODIFIED BRANCH AND BOUND METHOD FOR THE PROBLEM FOR THE APPOINTMENT OF PROCEDURES TO PATIENTS IN SANATORIUM

Published:2017-03-31 Issue: Volume:2 Page:16-23
ISSN:2461-4262
Container-title:EUREKA: Physics and Engineering
language:en
Short-container-title:

Author:

Danylchenko Anna¹,Kravchenko Svetlana¹

Affiliation:

1. Zhytomyr State Technological University

Abstract

For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound method was developed to find the maximum matching in a bipartite graph [1]. The algorithm takes into account the limits of compatibility procedures. The calculated experiment is aimed at proving the feasibility of paralleling of the optimal algorithm for solving the problem of scheduling the reception of medical procedures by patients for use in the sanatoriums of Ukraine. The experiment was carried out on computing platforms of different configurations with different computing power: a different number of processor cores, different amounts of memory, etc. Estimated minimum time scheduling, received at the computer platform with the maximum number of PCs is involved. Estimated time scheduling algorithm paralleling by using modifications of the branch and bound method is directly proportional to the number of vertices of a bipartite graph (which is equal to the sum of the number of procedures and the number of patients), the number of assigned procedures and restrictions.

Publisher

OU Scientific Route

Subject

General Physics and Astronomy,General Engineering

Reference13 articles.

1. Danilchenko, A. (2012). Optimal algorithm for solving the problem of matching with vanishing arcs. Science news, 6, 46–54.

2. Lupin, S. A., Milehina, T. V. (2007). The method for solving scheduling problems, focused on cluster computing systems. Proceedings of the universities. Ser. Electronics, 6, 63–69.

3. Gafarov, E. (2007). Hybrid algorithm for solving the problem of minimization of summarized delay for one device. Information technology, 1, 30–37.

4. Tymofijeva, N. K., Grycenko, V. I. (2011). Solving the problem of scheduling theory planning by structural alphabet search algorithm and hybrid. Upravliaiushchie sistemy i mashiny, 3, 21–36.

5. Panishev, A., Danilchenko, A., Danilchenko, A. (2012). The problem of matching with the disappearing "arcs". Simulation and informational technologies, 63, 75–81.