A goal programming model for scheduling residents in an anesthesia and reanimation department


GÜLER M. G., İDİN K., Guler E. Y.

EXPERT SYSTEMS WITH APPLICATIONS, cilt.40, sa.6, ss.2117-2126, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 40 Sayı: 6
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1016/j.eswa.2012.10.030
  • Dergi Adı: EXPERT SYSTEMS WITH APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2117-2126
  • Anahtar Kelimeler: Resident physician, Shift scheduling, Anesthesia and reanimation, Goal programming, Analytical hierarchical process, SLEEP-DEPRIVATION, SHIFT SYSTEMS, HEALTH-CARE, NURSE, PHYSICIANS, MEDICINE
  • Yıldız Teknik Üniversitesi Adresli: Hayır

Özet

Medicine residency is three to seven years of challenging graduate medical training that puts a lot of mental and physiological burden over the residents. Like other surgical branches, anesthesia and reanimation departments provide 24 h continuous service and the residents are the main providers of this service. The residents are assigned for on-call shifts during their training, as well as working during the regular day shifts. These schedules must address several considerations like preferences of the residents and coverage requirements of two different locations: the intensive care unit (ICU) and the surgery room (SR). In this study we develop a goal programming (GP) model for scheduling the shifts of the residents in the Anesthesia and Reanimation Department of Bezmialem Vakif University Medical School (BUMS). The rules that must be strictly met, like the number of on-duty shifts or preventing block shifts, are formulated as hard constraints. The preferences of the residents like increasing the number of weekends without shifts and assigning duties on the same night to the same social groups are formulated as soft constraints. The penalties for the deviation from the soft constraints are determined by the analytical hierarchy process (AHP). We are able to solve problems of realistic size to optimality in a few seconds. We showed that the proposed formulation, which the department uses currently, has yielded substantial improvements and much better schedules are created with less effort. (C) 2012 Elsevier Ltd. All rights reserved.