Abstract
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.
| Original language | English |
|---|---|
| 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 |
| Publisher | Coventry University |
| Pages | 201-207 |
| Number of pages | 7 |
| Volume | 1 |
| ISBN (Print) | 9781846000133 |
| Publication status | Published - 2006 |
| Event | ICSE - International Conference on Systems Engineering - Coventry, United Kingdom Duration: 5 Sept 2006 → 7 Sept 2006 |
Conference
| Conference | ICSE - International Conference on Systems Engineering |
|---|---|
| Abbreviated title | 18th ICSE |
| Country/Territory | United Kingdom |
| City | Coventry |
| Period | 5/09/06 → 7/09/06 |
Bibliographical note
This paper was given at the Eighteenth International Conference on Systems Engineering (ICSE 2006), Coventry: Coventry University, 2006.Keywords
- radiotherapy
- job shop problem
- patient scheduling
- metaheuristic.