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

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.