{"title":"Appointment scheduling of oncology outpatients","authors":"Abdellah Sadki, Xiaolan Xie, F. Chauvin","doi":"10.1109/CASE.2011.6042417","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of appointment scheduling of patients of an oncology outpatient unit. Each patient is first seen by his oncologist, and then the drug is prepared and injected to the patient. Two major resources including oncologists for consultation and beds for injection are considered. Idle times of oncologists are not allowed. The problem consists in scheduling the appointment time of each patient and the starting time of the injection in order to minimize the total weighted cost incurred by patient waiting times and the makespan. A Lagrangian relaxation-based heuristic and a local optimization heuristic are proposed. Numerical results show that the Lagrangian relaxation-based heuristic always outperforms the local optimization heuristic.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"261 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.2011.6042417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
This paper addresses the problem of appointment scheduling of patients of an oncology outpatient unit. Each patient is first seen by his oncologist, and then the drug is prepared and injected to the patient. Two major resources including oncologists for consultation and beds for injection are considered. Idle times of oncologists are not allowed. The problem consists in scheduling the appointment time of each patient and the starting time of the injection in order to minimize the total weighted cost incurred by patient waiting times and the makespan. A Lagrangian relaxation-based heuristic and a local optimization heuristic are proposed. Numerical results show that the Lagrangian relaxation-based heuristic always outperforms the local optimization heuristic.