A two-stage hybrid flow-shop formulation for sterilization processes in hospitals

被引:0
作者
Kraul, Sebastian [1 ]
机构
[1] Vrije Univ Amsterdam, Dept Operat Analyt, Boelelaan 1105, NL-1081 HV Amsterdam, Netherlands
关键词
Machine scheduling; Flow-shop problem; Parallel batching; Hospital operations; SDG 3 Good health and well-being; PARALLEL BATCHING MACHINES; REUSABLE INSTRUMENTS; GENETIC ALGORITHM; SHOP; SETUP; JOBS; OPTIMIZATION; DEVICES; COSTS; TIMES;
D O I
10.1016/j.eswa.2024.125624
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sterile processing is a critical secondary process and a major cost factor in the processing, acquisition, and storage of costly medical devices. This article aims to improve the performance of sterile processing by developing, implementing, and evaluating a dispatching rule-based algorithm to reduce the time medical devices spend in the central sterile supply department using a two-stage hybrid flow-shop formulation. The algorithm combines dispatching rules with stage decomposition and compatibility conditions. A genetic algorithm is designed to benchmark the performance in addition to an analytic bound. Real-world data from a large German hospital were used to test the effectiveness of the heuristics. The case study demonstrated the practical implications of the approach, leading to a reduction in the time medical devices spend in the system and improved utilization of washer-disinfector machines and sterilizers. It also highlighted the importance of aligning machine capacity with demand and the potential trade-offs associated with batch processing decisions. Our approach can contribute to substantial operational cost savings and efficiency gains, offering significant benefits to decision makers at both the operational and tactical levels.
引用
收藏
页数:14
相关论文
共 50 条
[21]   Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem [J].
Aria Azami ;
Kudret Demirli ;
Nadia Bhuiyan .
The International Journal of Advanced Manufacturing Technology, 2018, 95 :3259-3274
[22]   A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem [J].
Wang, Shijin ;
Liu, Ming .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) :1064-1075
[23]   Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem [J].
Azami, Aria ;
Demirli, Kudret ;
Bhuiyan, Nadia .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2018, 95 (9-12) :3259-3274
[24]   A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks [J].
Wang, Ling ;
Xu, Ye ;
Zhou, Gang ;
Wang, Shengyao ;
Liu, Min .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 59 (9-12) :1113-1125
[25]   A Reinforcement Learning Method for a Hybrid Flow-Shop Scheduling Problem [J].
Han, Wei ;
Guo, Fang ;
Su, Xichao .
ALGORITHMS, 2019, 12 (11)
[26]   Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: application at a hospital sterilisation plant [J].
Rossi, Andrea ;
Puppato, Alessio ;
Lanzetta, Michele .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (08) :2363-2376
[27]   Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search [J].
Cai, Jingcao ;
Zhou, Rui ;
Lei, Deming .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 38 (03) :3189-3199
[28]   A two-stage assembly flow-shop scheduling problem with bi-level products structure and machines' availability constraints [J].
Nikouei, Mohammad Ali ;
Zandieh, Mostafa ;
Amiri, Maghsoud .
JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2022, 39 (06) :494-503
[29]   A new mathematical formulation and a hybrid evolutionary algorithm for re-entrant flow-shop problem with release date [J].
Behmanesh, R. ;
Kianfar, K. .
SCIENTIA IRANICA, 2024, 31 (06) :500-517
[30]   A Two-Stage Cooperative Evolutionary Algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem [J].
Zhao, Fuqing ;
He, Xuan ;
Wang, Ling .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (11) :5291-5303