z-logo
open-access-imgOpen Access
Dynamic scheduling with cancellations: an application to chemotherapy appointment booking
Author(s) -
Yasin Göçgün
Publication year - 2018
Publication title -
an international journal of optimization and control theories and applications (ijocta)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.287
H-Index - 6
eISSN - 2146-5703
pISSN - 2146-0957
DOI - 10.11121/ijocta.01.2018.00469
Subject(s) - dynamic programming , markov decision process , scheduling (production processes) , computer science , job shop scheduling , mathematical optimization , dynamic priority scheduling , markov process , operations research , algorithm , mathematics , computer network , quality of service , statistics , routing (electronic design automation)
We study a dynamic scheduling problem that has the feature of due dates and time windows. This problem arises in chemotherapy scheduling where patients from different types have specific target dates along with time windows for appointment. We consider cancellation of appointments. The problem is modeled as a Markov Decision Process ( MDP ) and approximately solved using a direct-search based approximate dynamic programming ( ADP ) tehnique . We compare the performance of the ADP technique against the myopic policy under diverse scenarios. Our computational results reveal that the ADP technique outperforms the myopic policy on majority of problem sets we generated.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom