Elective and emergency patient scheduling modeling using network flows theory

In this paper, for the first time, network flows theory is used to solve the patient scheduling problem. Even though there are some studies about manufacturing and production scheduling in the literature, but there is no patient scheduling publication which has been modeled by network flows theory in major publishers. In this paper elective and emergency patient scheduling problem are investigated through maximum flow model, as one of the basic models of network flows theory. Since this model is easy to understand and perform by the hospital staff and also it is less complicated, comparing with other solutions, then it might be more applicable than the solution technics. Augmenting path flow algorithm is used to solve the problem, and an example has illustrated the capability of the algorithm

کلیدواژه ها:

Patient Scheduling ، Network Flows ، polynomial complexity ، emergency and elective patients ، Maximum Flow problem ، Augmenting path flow algorithm