Elective and emergency patient scheduling modeling using network flows theory

Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 319

متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICIORS11_152

تاریخ نمایه سازی: 30 دی 1397

Abstract:

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

Keywords:

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

Authors

Mansour Pourkheradmand

Department of Industrial Engineering, Yazd University, Yazd, Iran

Ahmad Sadegheih

Department of Industrial Engineering, Yazd University, Yazd, Iran

Hasan Hoseini-Nasab

Department of Industrial Engineering, Yazd University, Yazd, Iran

Alireza Haji

Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran