Buradasınız

HEMŞİRE ÇİZELGELEMESİNDE ESNEK VARDİYA PLANLAMASI VE HASTANE UYGULAMASI

FLEXIBLE SHIFT PLANNING IN NURSE SCHEDULING AND AN APPLICATION OF THE HOSPITAL

Journal Name:

Publication Year:

Abstract (2. Language): 
In the service industry, customer satisfaction becomes more difficult with each passing day, employers have looked for new paradigms and ways to make service quality better and to keep service facilities reliable. Therefore, with the purpose of increasing their competitive power, employers give more importance to their employees who have direct relation with customers than they do to their customer. One of the new paradigms is make working hours flexible. In this study, an integer programming model is proposed for the nurse scheduling problem in the hospitals which are one of the most important service industries. On the contrary of classical nurse scheduling model, developed model has made flexible to starting time. The main aim of the model is make a schedule for nurses according to their preferences. The developed model is applied on a surgery department of one university hospital with real data. According to results, model can satisfy 99,6% of the nurses with their schedule based on their preferences.
Abstract (Original Language): 
Müşteri tatmininin her geçen gün daha da zorlaştığı hizmet sektörlerinde, işverenler sunulan hizmetin kalitesini arttırmak ve hizmetin devamlılığını sağlamak için yeni arayışlar içine girmekteler. İşverenler, müşteriden önce hizmeti sunan kişilerin memnuniyetini sağlayarak rekabet gücünü arttırma yollarına başvurmaktadırlar. Bu yollardan biri de çalışma sürelerinin esnekleştirilmesidir. Bu çalışmada, hizmet sektörleri arasında önemli bir yere sahip olan hastanelerde ki hemşire çizelgeleme problemi için tam sayılı matematiksel bir model oluşturulmuştur. Oluşturulan modelde, klasik çizelgeleme modellerinin aksine hemşirelerin işe başlama saatlerine esneklik getirilmiştir. Modelin başlıca amacı, hemşirelerin kendi tercihlerine göre haftalık çizelgelerinin oluşturulmasıdır. Oluşturulan model, gerçek veriler kullanılarak bir üniversite hastanesinin genel cerrahi bölümünde denenmiştir. Modelin, %99,6 oranında hemşire tercihlerini yerine getirdiği görülmektedir.
115
133

REFERENCES

References: 

Aickelin, U. ve White, P. (2004). Building better nurse scheduling
algorithms. Annuals of Operation Research, 128 (1-4): 159-177.
Aykin, T. (2000). A comparative evaluation of modeling approaches to the
labor shift scheduling problem. European Journal of Operational Research, 125
(2): 381-397.
Aykin, T. (1996). Optimal shift scheduling with multiple break windows.
Management Science, 42 (4): 591-602.
Azaiez, M. N. ve Sharif, S. S. (2005). A 0-1 goal programming model for
nurse scheduling. Computers & Operations Research, 32 (3): 491-507.
Bailey, J. (1985). Integrated days off and shift personnel scheduling.
Computers and Industrial Engineering, 9 (4): 395-404.
Baker, K. R., Burns, R. N. ve Carter, M. W. (1980). Staff scheduling with
day-off and workstretch constraints. AIIE Transaction. 11 (4): 286-292.
Baker, K. R. (1985). Workforce allocation in cyclical scheduling problems:
A survey. Operation Research, 5 (3): 327-337.
Baker, K. (1974). Scheduling a full time workforce to meet cyclic staffing
requirements. Management Science, 20 (12): 1561-1569.
Bechtold, S. E ve Jacobs, L. W. (1990). Implicit modeling of flexible break
assignments in optimal shift scheduling. Management Science, 36 (11): 1339-1351.
Brownell, W. S. ve Lowerre, J. M. (1976). Scheduling of workforces
required in continuous operations under alternate labour policies. Management
Science, 22 (5): 597-605.
Brunner, J. O, Bard, J. F. ve Kolisch, R. (2010). Midterm scheduling of
physicians with flexible shifts using branch and price. IIE Transactions, 43 (2), 84-
109.
Brusco, M. J. ve Jacobs. L. W. (1993). A simulated annealing approach to
the cyclic staff scheduling problem. Naval Research of Logistics, 40 (1): 69-84.
Burke, E. K, De-Causmaecker, P., Vanden, B. G. ve Van, L. H. (2004).
The state of the art of nurse rostering. Journal of Scheduling, 7 (6): 441–449.
Burns, R. N. (1978). Manpower scheduling with variable demands and
alternate weekends off. Informs, 16 (2): 101-112.
Burns, R. N. ve Carter, M. W. (1985). Work force size and single shift
schedules with variable demands. Management Science, 31 (5): 599-607.
Carter, M. W. ve Lapierre, S. D. (2001). Scheduling emergency room
physicians. Health Care Management Science, 4 (4): 347-360.
Öztürkoğlu, Y., Çalışkan, F. DEÜ SBE Dergisi, Cilt: 16, Sayı: 1
132
Easton, F. F. (2011). Cross-training performance in flexible labor
scheduling environments, IIE Transactions, 43 (8): 589-603.
Ferland, J. A., Berrada, I. ve Imene, N. (2001). Generalized assignment
type goal programming problem: application to nurse scheduling. Journal of
Heuristics, 7 (4): 391-413.
Gaballa, A. ve Pearce, W. (1979). Telephone sales manpower planning at
qantas. Interfaces, 9 (3): 1-9.
Howell, J. P. (1966). Cyclical scheduling of nursing personnel. Hospital
J.A.H.A., 40 (2): 77-85.
Ikegami, A. N. (2003). A sub-problem centric model and approach to the
nurse scheduling problem. Mathematical Programming Series B, 97: 517–541.
Jlassi, J., Chabchoub, H. ve El-Mhamedi, A. (2011). “A Combined AHPGP
Model for Nurse Scheduling” 4 th International Conference on Logistics, May
31-June3, Hammamet.
Maier-Rothe, C. ve Wolfe, H. B. (1973). Cycle scheduling and allocation
of nursing staff. Socio-Economic Planning Sciences, 7 (5): 471-487.
Meglino, B. M. (1979). A methodology for nurse staffing. ABI/INFORM
Global, 21 (3): 82-93.
Miller, H. E., Pierskalla, W. P. ve Rath, G. J. (1976). Nurse scheduling
using mathematical programming. Operations Research, 24 (5): 857-870.
Morrish, A. R.ve O’Connor, A. R. (1970). Cyclic scheduling. The Journal
of Nursing Administration, 1 (5): 49-54.
Özkarahan, İ. ve Bailey, J. E. (1988). Goal programming model subsytem
of a flexible nurse scheduling support system. IIE Transactions, 20 (3): 306-316.
Rothstein, M. (1973). Hospital manpower shift scheduling by mathematical
programming. Health Service Research of Journal, 8 (1): 60-66.
Seçkiner, S. U. ve Kurt, M. (2005). Bütünleşik tur-rotasyon çizelgeleme
yaklaşımı ile işyükü minimizasyonu. Journal Faculty of Engineering of Architecht
of Gazi University, 20 (2): 161-169.
Sowalter, M. J. ve Mabert, V. A. (1988). An evaluation of a full/part time
tour scheduling methodology. International Operation and Production
Management, 8 (7): 54-71.
Taylor, P. E. ve Huxley, J. (1989). A break from tradition for the
sanfrancisco police: patrol officer scheduling using an optimization based decision
support system. Interfaces, 19 (1): 4-24.
Hemşire Çizelgelemesinde Esnek… DEU Journal of GSSS, Vol: 16, Issue: 1
133
Thompson, G. M. (1996). Optimal scheduling of shifts and breaks using
employees haing limited time availability. International Journal of Service
Industry Management, 7 (1): 56-73.
Thompson, G. M. (1990). Shift scheduling in services when employees
have limited availability: an l.p. approach. Journal of Operation Mnagement, 9 (3):
352-370.
Topaloğlu, Ş. ve Özkarahan, İ. (2004). An implicit goal programming
model for the tour scheduling problem considering the employee work preferences.
Annuals of Operations Research, 128 (1-4): 135-158.
Tsai, C. C. ve Li, S. H. A. (2009). A two stage modeling with genetic
algorithms for the nurse scheduling problem. Expert Sytems with Applications, 36
(5): 9506-9512.
Valouxis, C. ve Housos, E. (2000). Hybrid optimization techniques for the
work shift and rest assignment of nursing personnel. Artificial Intelligence, 20 (2):
155-175.
Warner, D. M. (1976). Scheduling nursing personnel according to nursing
preference: A mathematical programming approach. Operations. Ressearch, 24
(5): 842-856.
Wolfe, H. ve Young, J. P. (1965). Staffing the nursing unit: Part II. Nursing
Research, 4 (14): 299-303.

Thank you for copying data from http://www.arastirmax.com