肿瘤科门诊预约安排

Abdellah Sadki, Xiaolan Xie, F. Chauvin
{"title":"肿瘤科门诊预约安排","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":"{\"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}","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

摘要

本文讨论了肿瘤门诊病人的预约调度问题。每个病人首先由他的肿瘤科医生看病,然后药物被准备好并注射到病人体内。两种主要资源包括会诊肿瘤科医生和注射床位。肿瘤医生不允许有空闲时间。该问题包括如何安排每位患者的预约时间和注射开始时间,以使患者等待时间和完工时间所产生的总加权成本最小。提出了一种基于拉格朗日松弛的启发式算法和一种局部优化启发式算法。数值结果表明,基于拉格朗日松弛的启发式算法总是优于局部优化启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Appointment scheduling of oncology outpatients
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信