Workload Balancing Among Heathcare Workers Under Uncertain Service Time Using Distributionally Robust Optimization

被引:1
|
作者
Anh, Nguyen Duy [1 ]
机构
[1] Hanoi Obstet & Gynecol Hosp, Hanoi 100000, Vietnam
关键词
Fairness in healthcare; task allocations; stochastic service time; distributionally robust optimization; joint chance constraint; JOB-SATISFACTION; HEALTH;
D O I
10.1142/S0217595921500457
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Healthcare systems are facing serious challenges in balancing their human resources to cope with volatile service demand, while at the same time providing necessary job satisfaction to the healthcare workers. In this paper, we propose a distributionally robust optimization formulation to generate a task assignment plan that promotes the fairness in allocation, attained by reducing the difference in the total working time among workers, under uncertain service time. The proposed joint chance constraint model is conservatively approximated by a worst-case Conditional Value-at-Risk, and we devise a sequential algorithm to solve the finite-dimensional reformulations which are linear (mixed-binary) optimization problems. We also provide explicit formula in the situation where the support set of the random vectors is a hyperrectangle. The experiment with both synthetic and real data indicates promising results for our distributionally robust optimization approach.
引用
收藏
页数:27
相关论文
共 33 条
  • [21] Using modified metaheuristic algorithms to solve a hazardous waste collection problem considering workload balancing and service time windows
    Rabbani, Masoud
    Nikoubin, Alireza
    Farrokhi-Asl, Hamed
    SOFT COMPUTING, 2021, 25 (03) : 1885 - 1912
  • [22] Two-stage distributionally robust mixed-integer optimization model for three-level location-allocation problems under uncertain environment
    Liu, Zhimin
    Wu, Zhong
    Ji, Ying
    Qu, Shaojian
    Raza, Hassan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 572
  • [23] Robust Optimization Model of Multi-logistics-task Allocation Under Service Time Uncertainty
    Teng, Li
    2016 INTERNATIONAL CONFERENCE ON LOGISTICS, INFORMATICS AND SERVICE SCIENCES (LISS' 2016), 2016,
  • [24] Emergency Logistics Scheduling Under Uncertain Transportation Time Using Online Optimization Methods
    Zhang, Yutong
    Liu, Jing
    IEEE ACCESS, 2021, 9 : 36995 - 37010
  • [25] Time-of-day pricing for toll roads under traffic demand uncertainties: A distributionally robust simulation-based optimization method
    Zheng, Liang
    Liu, Pengjie
    Huang, Huimin
    Ran, Bin
    He, Zhengbing
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2022, 144
  • [26] Adaptive density-based robust topology optimization under uncertain loads using parallel computing
    Herrero-Perez, David
    Pico-Vicente, Sebastian Gines
    Martinez-Barbera, Humberto
    ENGINEERING WITH COMPUTERS, 2024, 40 (01) : 21 - 43
  • [27] Adaptive density-based robust topology optimization under uncertain loads using parallel computing
    David Herrero-Pérez
    Sebastián Ginés Picó-Vicente
    Humberto Martínez-Barberá
    Engineering with Computers, 2024, 40 : 21 - 43
  • [28] The data-driven newsvendor problem: Achieving on-target service-levels using distributionally robust chance-constrained optimization
    Laan, Niels van der
    Teunter, Ruud H.
    Romeijnders, Ward
    Kilic, Onur A.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2022, 249
  • [29] A multi objective FLND problem under uncertain environment using robust optimization: A heuristic approach and case study
    Shishebori, Davood
    Yousefi-Babadi, Abolghasem
    Davoudi, Ashkan
    2016 12TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING (ICIE), 2016,
  • [30] A Coordinated Bidding Model for Wind Plant and Compressed Air Energy Storage Systems in the Energy and Ancillary Service Markets Using a Distributionally Robust Optimization Approach
    Aldaadi, Mohsen
    Al-Ismail, Fahad
    Al-Awami, Ali T.
    Muqbel, Ammar
    IEEE ACCESS, 2021, 9 : 148599 - 148610