Capacity planning for a network of community health services

摘要

Community care services are becoming increasingly important to health delivery as patients live longer but with chronic disease. In this research, we propose a queuing network approach to capacity planning for a network of services. We take advantage of existing heuristics that calculate the probability of blocking for a given capacity plan and utilize the output of these heuristics to run a simulated annealing approach to optimize capacity allocation across the network subject to a performance guarantee related to the sum of the blocking probabilities. We apply this model to a local health region with a network of six services - acute care, long term care, assisted living, home care, rehabilitation and chronic care. We test the results of the optimization model through a simulation that incorporates more realism than is possible in the queuing model and that also allows us to determine the transient behaviour of the system as it transitions from current capacity levels to the those proposed by the optimization model. (C) 2018 Elsevier B.V. All rights reserved.