Dynamic scheduling with cancellations: An application to chemotherapy appointment booking
Yükleniyor...
Dosyalar
Tarih
2018
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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) technique. 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.
Açıklama
Anahtar Kelimeler
Dynamic Scheduling, Markov Decision Processes, Approximate Dynamic Programming
Kaynak
An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
WoS Q Değeri
Scopus Q Değeri
Q2
Cilt
8
Sayı
2
Künye
Göçgün, Y. (2018). Dynamic scheduling with cancellations: an application to chemotherapy appointment booking. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 8(2), 161-169.
