Dynamic Capacity Planning and Location of Hierarchical Service Networks Under Service Level Constraints

被引:15
|
作者
Pehlivan, Canan [1 ]
Augusto, Vincent [1 ]
Xie, Xiaolan [1 ,2 ]
机构
[1] Ecole Natl Super Mines, Ctr Biomed & Healthcare Engn, CNRS UMR LIMOS 6158, F-42023 St Etienne, France
[2] Shanghai Jiao Tong Univ, Dept Ind Engn & Management, Shanghai 200030, Peoples R China
基金
中国国家自然科学基金;
关键词
Capacity planning; health care network; mathematical programming; queueing networks; service level; service location; CARE; MANAGEMENT; ACCESS; ALLOCATION; OCCUPANCY; MODEL; BEDS; UNIT;
D O I
10.1109/TASE.2014.2309255
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the problem of joint facility location and capacity planning of hierarchical service networks in order to determine when and where to open/close service units, their capacity and the demand-to-facility allocation. We propose a new hierarchical service network model in which both the facilities and customers have nested hierarchies, i.e., a higher level facility provides all services provided by a lower level facility and a customer requiring a certain level of service will additionally require lower level services. Poisson customer arrivals and random service times are assumed. Each service unit is modeled as an Erlang-loss system and its service level, defined as its customer acceptance probability, is given by the so-called Erlang-loss function. A nonlinear programming model is proposed to minimize the total cost, while keeping the service level of all service units above some given level. Different linearization models of the Erlang-loss function and their properties are proposed. Linearization transforms the nonlinear model into compact mixed integer programs solvable to optimality with standard solvers. Application to a real-life perinatal network is then presented. Note to Practitioners-This paper is motivated by our collaboration with the perinatal network inHauts-de-Seine, Paris, France. It is a network of maternity facilities of different types where at most three levels of services (obstetric, neonatal, and neonatal intensive care) are provided. All facilities provide the lowest level of care: obstetric service. The maternity facilities differ according to the level of service provided. Network shows a nested hierarchical property where a higher level facility provides all services provided by a lower level facility. Each hospital has a limited number of staffed-beds for each service. As the demographic changes, the perinatal network is facing the problem of relocating its perinatal services and adjusting its capacities to match the changing demand. The mathematical models of this paper take into account different options such as opening/closing a service unit, capacity expansion, downsizing, and transfer. The models are used to help decision-makers sorting these decisions to minimize the overall cost of the network without degrading the service level.
引用
收藏
页码:863 / 880
页数:18
相关论文
共 50 条
  • [1] Facility location under service level constraints for heterogeneous customers
    Jayaswal, Sachin
    Vidyarthi, Navneet
    ANNALS OF OPERATIONS RESEARCH, 2017, 253 (01) : 275 - 305
  • [2] Facility location under service level constraints for heterogeneous customers
    Sachin Jayaswal
    Navneet Vidyarthi
    Annals of Operations Research, 2017, 253 : 275 - 305
  • [3] Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level
    Lin, Carrie Ka Yuk
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
  • [4] Service capacity planning of the community hospital under the hierarchical medical system
    Zhou, Yulin
    Zhou, Wenhui
    Zhang, Shuo
    Wan, Qiang
    2016 13TH INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, 2016,
  • [5] Locating and staffing service centers under service level constraints
    Venkateshan, Prahalad
    Mathur, Kamlesh
    Ballou, Ronald H.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (01) : 55 - 70
  • [6] Dynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints
    He, RX
    Lin, B
    Li, LM
    Gu, C
    PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2005, : 205 - 209
  • [7] Trip planning for visitors in a service system with capacity constraints
    Luo, Xing-Gang
    Liu, Xin-Rui
    Ji, Peng-Li
    Shang, Xuan-Zhu
    Zhang, Zhong-Liang
    COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [8] Planning of Resource Replenishment Location for Service Trucks Under Network Congestion and Routing Constraints
    Hajibabai, Leila
    Ouyang, Yanfeng
    TRANSPORTATION RESEARCH RECORD, 2016, (2567) : 10 - 17
  • [9] Transport logistics planning with service-level constraints
    Lau, HC
    Ng, KM
    Wu, XT
    PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 519 - 524
  • [10] Using Lagrangean Relaxation for service location planning with QoS constraints in large-scale networks
    Kamal, Zille Huma
    Al-Fuqaha, Ala
    Gupta, Ajay
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 424 - 428