Robust goal programming approach for healthcare network management for perishable products under disruption

被引:8
|
作者
Hasani, Aliakbar [1 ]
Sheikh, Reza [1 ]
机构
[1] Shahrood Univ Technol, Dept Ind Engn & Management, Shahrud, Iran
关键词
Healthcare network; Robust goal programming; Perishable product; Disruption management; SUPPLY CHAIN NETWORK; EMERGENCY MEDICAL-SERVICES; FACILITY LOCATION MODEL; DESIGN PROBLEM; RELIEF NETWORK; OPTIMIZATION; UNCERTAINTY; STRATEGIES; HOSPITALS; EFFICIENT;
D O I
10.1016/j.apm.2022.12.021
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a robust goal programming model for a healthcare network design problem under disruption is developed. The objective of the proposed multi-period, multi-echelon model is to simultaneously optimize the total deviation from the considered three goals, including minimizing network cost, maximizing network coverage, and maximizing net-work reliability. Distribution uncertainty of healthcare demand and facility capacity is cap-tured. The perishability of healthcare products is regarded with limited shelf-life. Using an option contract ensures appropriate coordination with suppliers during pre and post -disaster periods. Via handling the tractable robust budget-based counterpart model, suit-able strategies are proposed to present the designed network's efficiency and effective-ness. Risk mitigation strategies deal with disrupted demand and supply in the healthcare network with specific impacts on coverage, cost, and reliability of the services. The pro-posed cooperate coverage mechanism provides appropriate service coverage under disrup-tion propagation. Finally, the option contract has achieved cost-efficient coordination un-der demand uncertainty. Furthermore, practical managerial insights are demonstrated by investigating a real-life case study and conducting extensive sensitivity analyses.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:399 / 416
页数:18
相关论文
共 50 条
  • [41] Forest management optimisation models and habitat diversity: a goal programming approach
    Bertomeu, M
    Romero, C
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (11) : 1175 - 1184
  • [42] Fuzzy goal programming approach for water quality management in a river basin
    Lee, CS
    Wen, CG
    FUZZY SETS AND SYSTEMS, 1997, 89 (02) : 181 - 192
  • [43] Resource allocation to strategies of quality management with FANP and Goal Programming approach
    Rezaee, Elham
    Pooya, Alireza
    TQM JOURNAL, 2019, 31 (05): : 850 - 870
  • [44] HIERARCHICAL GOAL-PROGRAMMING APPROACH TO ENVIRONMENTAL LAND USE MANAGEMENT
    CHARNES, A
    HAYNES, KE
    HAZLETON, JE
    RYAN, MJ
    GEOGRAPHICAL ANALYSIS, 1975, 7 (02) : 121 - 130
  • [45] Evaluation of multifarious solid waste management systems - A goal programming approach
    Shekdar, AV
    Mistry, PB
    WASTE MANAGEMENT & RESEARCH, 2001, 19 (05) : 391 - 402
  • [46] A Lagrange Programming Neural Network Approach for Robust Ellipse Fitting
    Wang, Hao
    Feng, Ruibin
    Leung, Chi-Sing
    So, Hing Cheung
    NEURAL INFORMATION PROCESSING (ICONIP 2017), PT III, 2017, 10636 : 686 - 696
  • [47] Lexicographical dynamic goal programming approach to a robust design optimization within the pharmaceutical environment
    Vo Thanh Nha
    Shin, Sangmun
    Jeong, Seong Hoon
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (02) : 505 - 517
  • [48] A new robust dynamic Bayesian network approach for disruption risk assessment under the supply chain ripple effect
    Liu, Ming
    Liu, Zhongzheng
    Chu, Feng
    Zheng, Feifeng
    Chu, Chengbin
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (01) : 265 - 285
  • [49] A Location-Inventory-Pricing Supply Chain Network Design for Perishable Products Under Disruptions
    Asghari, Tooba
    Aghamohamadi-Bosjin, Soroush
    Rabbani, Masoud
    IRANIAN JOURNAL OF MANAGEMENT STUDIES, 2021, 14 (03) : 487 - 507
  • [50] Robust approach for air cargo freight forwarder selection under disruption
    Feng, Bo
    Jiang, Zheyu
    Lai, Fujun
    ANNALS OF OPERATIONS RESEARCH, 2020, 291 (1-2) : 339 - 360