Title of article :
A constraintprogramming-basedsolutionapproachformedicalresident
schedulingproblems
Author/Authors :
Seyda Topaloglu، نويسنده , , IremOzkarahan ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
Persistentcallscomefromwithinthegraduatemedicaleducationcommunityandfromexternal
sourcesforregulatingtheresidentdutyhoursinordertomeettheobligationsaboutthequalityof
residenteducation,thewell-beingofresidentsthemselves,andthequalityofpatientcareservices.The
report oftheAccreditationCouncilforGraduateMedicalEducation(ACGME)proposescommon
programrequirementsforresidenthours.Inthispaper,wefirstdevelopamixed-integerprogramming
model forschedulingresidents’dutyhoursconsideringtheon-callnight,day-off,restperiod,andtotal
work-hourACGMEregulationsaswellasthedemandcoveragerequirementsoftheresidencyprogram.
Subsequently,weproposeacolumngenerationmodelthatconsistsofamasterproblemandan
auxiliaryproblem.Themasterproblemfindsaconfigurationofindividualschedulesthatminimizesthe
sum ofdeviationsfromthedesiredservicelevelsforthedayandnightperiods.Theformulationofthis
problemispossiblebyrepresentingthefeasibleschedulesusingcolumnvariables,whereasthe
auxiliaryproblemfindsthewholesetoffeasibleschedulesusingconstraintprogramming.
The proposedapproachhasbeentestedonaseriesofproblemsusingrealdataobtainedfroma
hospital.Theresultsindicatethathigh-qualityschedulescanbeobtainedwithinafewseconds.
Keywords :
Medical resident scheduling , Mixed-integer programming , Constraint programming , Accreditation Council for Graduate Medical Education , Duty hours
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
