Surgery Scheduling in Outpatient Procedure Centre with Re-entrant Patient Flow and Fuzzy Service Times
Surgery Scheduling in Outpatient Procedure Centre with Re-entrant Patient Flow and Fuzzy Service Times
复制标题
具有可重入性患者流和模糊服务时间的门诊手术中心手术调度
DOI：
10.1016/j.omega.2020.102350
复制
发表时间：
2020-10
期刊：
影响因子：
--
通讯作者：
Lei Zhou
中科院分区：
文献类型：
--
作者：
Kai Wang;Hu Qin;Yun Huang;Mengwen Luo;Lei Zhou
为配合门诊手术服务需求的增加，门诊手术中心的手术安排已引起医疗业界及学术界的高度关注。本文考虑了一种新的OPC每日手术调度问题（ODSSP），以最小化所有患者的平均恢复完成时间。为了满足OPC手术实践，将患者的入院和康复应用于同一区域，以获得更大的资源灵活性，并且考虑了入院、手术和康复的不确定服务时间。由于医疗保健提供系统和生产系统之间的相似性，ODSSP被表述为具有模糊服务时间的两阶段无等待可重新进入混合流车间调度问题。考虑到调度问题的np -硬度，采用一种新的混合元启发式算法（GA-BAVNS）来获得详细的OPC每日手术时间表。为了在搜索空间的探索和利用之间取得更好的平衡，GA- bavns混合了遗传算法（GA）和可变邻域搜索（VNS）来安排门诊手术服务。为了提高VNS的局部搜索性能，采用了六种新的基于块的邻域结构来生成邻域解。此外，采用自适应邻域变化过程（ANCP）系统地改变邻域结构的搜索顺序以获得更好的解。一组测试问题的计算结果表明了所提出的GA-BAVNS的优越性。
To meet the increase in demand for outpatient surgical services, surgery scheduling for outpatient procedure centres (OPCs) has recently attracted considerable attention in both the healthcare industry and the academic community. This paper considers a novel OPC daily surgery scheduling problem (ODSSP) to minimise the average recovery completion time of all patients. To satisfy the OPC surgical practice, patient intake and recovery are applied in the same area for more resource flexibility, and uncertain service times for intake, surgical procedures and recovery are considered. Owing to the similarities shared between healthcare delivery systems and production systems, ODSSP is formulated as a two-stage no-wait re-entrant hybrid flow shop scheduling problem with fuzzy service times. Considering the NP-hardness of such scheduling problem, a new hybrid meta-heuristic (GA-BAVNS) is employed to obtain detailed daily OPC surgery schedules. To achieve greater balance between exploration and exploitation in the search space, GA-BAVNS hybridises a genetic algorithm (GA) and a variable neighbourhood search (VNS) to schedule outpatients for surgical services. To improve the local search performance of the VNS, six novel block-based neighbourhood structures are employed to generate neighbourhood solutions. Moreover, an adaptive neighbourhood change procedure (ANCP) is employed to systematically change the search order of neighbourhood structures for better solutions. Computational results on a set of test problems indicate the superiority of the proposed GA-BAVNS.
登录
查看更多内容
影响因子：
4.6
作者：
Guido, Rosita;Conforti, Domenico
通讯作者：
Conforti, Domenico
排列流水车间调度，批量交付给供应链中的多个客户
影响因子：
8.7
作者：
Wang Kai;Luo Hao;Liu Feng;Yue Xiaohang
通讯作者：
Yue Xiaohang
影响因子：
9.2
作者：
K. Wang;W. Ma;H. Luo;H. Qin
通讯作者：
K. Wang;W. Ma;H. Luo;H. Qin
DOI：
10.1007/978-3-030-15843-9
发表时间：
2018
期刊：
Lecture Notes in Computer Science
影响因子：
--
作者：
Angelo Sifaleras;S. Salhi;J. Brimberg
通讯作者：
Angelo Sifaleras;S. Salhi;J. Brimberg
影响因子：
9.2
作者：
Xiang Zhong;H. Lee;Jingshan Li
通讯作者：
Xiang Zhong;H. Lee;Jingshan Li