This paper describes the radiotherapy patient scheduling problem of minimising waiting times. Like many other service industry problems, radiotherapy patient scheduling may be solved by first modelling and formulating it into a shop scheduling problem. Over the years, these shop scheduling models have been researched and solved using various approaches. This paper typifies radiotherapy patient scheduling into a job shop problem. In addition, exact and metaheuristic approaches of solving job shop scheduling problems are also reviewed and comparatively analysed.
|Title of host publication||Proceedings of the Eighteenth International Conference on Systems Engineering (ICSE2006)|
|Editors||Keith J. Burnham, Olivier C.L. Haas|
|Place of Publication||Coventry|
|Number of pages||7|
|Publication status||Published - 2006|
|Event||ICSE - International Conference on Systems Engineering - Coventry, United Kingdom|
Duration: 5 Sep 2006 → 7 Sep 2006
|Conference||ICSE - International Conference on Systems Engineering|
|Abbreviated title||18th ICSE|
|Period||5/09/06 → 7/09/06|
Bibliographical noteThis paper was given at the Eighteenth International Conference on Systems Engineering (ICSE 2006), Coventry: Coventry University, 2006.
- job shop problem
- patient scheduling
Kapamara, T., Sheibani, K., Haas, O. C. L., Reeves, C. R., & Petrovic, D. (2006). A review of scheduling problems in radiotherapy. In K. J. Burnham, & O. C. L. Haas (Eds.), Proceedings of the Eighteenth International Conference on Systems Engineering (ICSE2006) (Vol. 1, pp. 201-207). Coventry: Coventry University.