TY - GEN
T1 - Medical Staff Scheduling Problem in Chinese Mobile Cabin Hospitals During Covid-19 Outbreak
AU - Lan, Shaowen
AU - Fan, Wenjuan
AU - Shao, Kaining
AU - Yang, Shanlin
AU - Pardalos, Panos M.
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - In this paper, we discuss the medical staff scheduling problem in the Mobile Cabin Hospital (MCH) during the pandemic outbreaks. We investigate the working contents and patterns of the medical staff in the MCH of Wuhan during the outbreak of Covid-19. Two types of medical staff are considered in the paper, i.e., physicians and nurses. Besides, two different types of physicians are considered, i.e., the expert physician and general physician, and the duties vary among different types of physicians. The objective of the studied problem is to get the minimized number of medical staff required to accomplish all the duties in the MCH during the planning horizon. To solve the studied problem, a general Variable Neighborhood Search (general VNS) is proposed, involving the initialization, the correction strategy, the neighborhood structure, the shaking procedure, the local search procedure, and the move or not procedure. The mutation operation is adopted in the shaking procedure to make sure the diversity of the solution and three neighborhood structure operations are applied in the local search procedure to improve the quality of the solution.
AB - In this paper, we discuss the medical staff scheduling problem in the Mobile Cabin Hospital (MCH) during the pandemic outbreaks. We investigate the working contents and patterns of the medical staff in the MCH of Wuhan during the outbreak of Covid-19. Two types of medical staff are considered in the paper, i.e., physicians and nurses. Besides, two different types of physicians are considered, i.e., the expert physician and general physician, and the duties vary among different types of physicians. The objective of the studied problem is to get the minimized number of medical staff required to accomplish all the duties in the MCH during the planning horizon. To solve the studied problem, a general Variable Neighborhood Search (general VNS) is proposed, involving the initialization, the correction strategy, the neighborhood structure, the shaking procedure, the local search procedure, and the move or not procedure. The mutation operation is adopted in the shaking procedure to make sure the diversity of the solution and three neighborhood structure operations are applied in the local search procedure to improve the quality of the solution.
KW - Covid-19 pandemic
KW - Medical staff scheduling
KW - Mobile Cabin Hospital
KW - Variable neighborhood search
UR - https://www.scopus.com/pages/publications/85121910872
U2 - 10.1007/978-3-030-92121-7_18
DO - 10.1007/978-3-030-92121-7_18
M3 - 会议稿件
AN - SCOPUS:85121910872
SN - 9783030921200
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 211
EP - 218
BT - Learning and Intelligent Optimization - 15th International Conference, LION 15, 2021, Revised Selected Papers
A2 - Simos, Dimitris E.
A2 - Pardalos, Panos M.
A2 - Kotsireas, Ilias S.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 15th International Conference on Learning and Intelligent Optimization, LION 15 2021
Y2 - 20 June 2021 through 25 June 2021
ER -