Title of article :
An electivesurgeryschedulingproblemconsideringpatientpriority
Author/Authors :
Daiki Min ، نويسنده , , YuehwernYih ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Pages :
9
From page :
1091
To page :
1099
Abstract :
This paperaddressesaschedulingproblemwherepatientswithdifferentprioritiesarescheduledfor electivesurgeryinasurgicalfacility,whichhasalimitedcapacity.Whenthecapacityisavailable, patientswithahigherpriorityareselectedfromthewaitinglistandputontheschedule.Atthe beginningofeachperiod,adecisionofthenumberofpatientstobescheduledismadebasedonthe trade-offs betweenthecostforovertimeworkandthecostforsurgerypostponement.Astochastic dynamicprogrammingmodelisformulatedtoaddressthisproblem.Astructuralanalysisofthe proposed modelisconductedtounderstandthepropertiesofanoptimalschedulepolicy.Basedonthe structuralanalysis,boundsonfeasibleactionsareincorporatedintoavalueiterationalgorithm,anda brief computationexperimentshowstheimprovementincomputationalefficiency.Numerical examplesshowthattheconsiderationofpatientpriorityresultsinsignificantdifferencesinsurgery schedulesfromtheschedulethatignoresthepatientpriority.
Keywords :
Surgery scheduling problem , stochastic dynamic programming , Patient priority
Journal title :
Computers and Operations Research
Serial Year :
2010
Journal title :
Computers and Operations Research
Record number :
927718
Link To Document :
بازگشت