دانلود مقاله ISI انگلیسی شماره 89869
ترجمه فارسی عنوان مقاله

فرمول و راه حل جدید برای مشکل برنامه ریزی پرستار: مطالعه موردی در مصر

عنوان انگلیسی
A new formulation and solution for the nurse scheduling problem: A case study in Egypt
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
89869 2018 10 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Alexandria Engineering Journal, Available online 12 February 2018

ترجمه کلمات کلیدی
مشکل برنامه ریزی پرستار، کمینه سازی هزینه، ترجیحات پرستاران، راه حل های دقیق مدل برنامهریزی خطی دوتایی، جریان شبکه چند کالای،
کلمات کلیدی انگلیسی
Nurse scheduling problem; Cost minimization; Nurses preferences; Exact solutions; Binary linear programming model; Multi-commodity network flow;
پیش نمایش مقاله
پیش نمایش مقاله  فرمول و راه حل جدید برای مشکل برنامه ریزی پرستار: مطالعه موردی در مصر

چکیده انگلیسی

Nurse Scheduling Problem (NSP) is the assignment of a number of nurses to a number of shifts in order to satisfy hospital’s demand. The objectives of NSP are the minimization of the overall hospital cost, and the maximization of nurses’ preferences while taking into consideration the governmental rules and hospital standards. In this article, a proposed mathematical model for the NSP is presented, which is based on the idea of multi-commodity network flow model. The proposed model was verified using hypothetical instances as well as benchmark instances, then, it is applied to a real case study in an Egyptian hospital. The results demonstrate the advantage of using the proposed model in generating schedule required to solve the problem. Furthermore, it proves the superiority of the obtained schedule to those generated manually by the supervisor head nurse as it improves the level of nurses’ satisfaction by creating fair schedule system take care about nurses’ preferences as well as decreases the overall overtime cost by 36%.