Mathematical Analysis of Queue with Phase Service: An Overview

We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent

Modelling activities in a Critical Care Unit

The Critical Care Unit (CCU) is the sector of the hospital where, as the name suggests, critically ill patients receive treatment. The main aim of this research is to identify and apply suitable Operational Research techniques to model patient flow in the CCU at the University Hospital of Wales, Cardiff. The Operational Research techniques employed in this thesis include queueing theory and simulation. These methods have been utilised previously in the field of healthcare with much success. The thesis begins by considering two aspects of queueing theory, namely batch service queueing theory and batch arrival queueing theory. The latter of these is utilised to model patient flow within the CCU. Although queueing theory may be used as a good approximation to activities in the Unit, it does not incorporate all aspects of real-life. Thus discrete-event simulation is suggested as an alternative approach. Two types of statistical analysis, CART and Regression, are applied to both length of stay and mortality variables. The results from these statistical tests are compiled and investigated in more depth. Finally, a discrete event simulation model is built in Visual Basic for Applications, for Microsoft Excel. This simulation model incorporates many of the complexities of a CCU, such as patient priority and cancellation of scheduled patients if all beds on the Unit are occupied. The model is then used to test various "what-if type" scenarios, including the possibility of funding additional beds, the concept of ring-fencing of beds for different levels of care, and the likely effect of reducing the impact of bed-blocking

Modelling and solving healthcare decision making problems under uncertainty

The efficient management of healthcare services is a great challenge for healthcare managers because of ageing populations, rising healthcare costs, and complex operation and service delivery systems. The challenge is intensified due to the fact that healthcare systems involve various uncertainties. Operations Research (OR) can be used to model and solve several healthcare decision making problems at strategic, tactical and also operational levels. Among different stages of healthcare decision making, resoure allocation and capacity planning play an important role for the overall performance of the complex systems. This thesis aims to develop modelling and solution tools to support healthcare decision making process within dynamic and stochastic systems. In particular, we are concerned with stochastic optimization problems, namely i) capacity planning in a stem-cell donation network, ii) resource allocation in a healthcare outsourcing network and iii) real-time surgery planning. The patient waiting times and operational costs are considered as the main performance indicators in these healthcare settings. The uncertainties arising in patient arrivals and service durations are integrated into the decision making as the most significant factors affecting the overall performance of the underlying healthcare systems. We use stochastic programming, a collection of OR tools for decision-making under uncertainty, to obtain robust solutions against these uncertainties. Due to complexities of the underlying stochastic optimization models such as large real-life problem instances and non-convexity, these models cannot be solved efficiently by exact methods within reasonable computation time. Thus, we employ approximate solution approaches to obtain feasible decisions close to the optimum. The computational experiments are designed to illustrate the performance of the proposed approximate methods. Moreover, we analyze the numerical results to provide some managerial insights to aid the decision-making processes. The numerical results show the benefits of integrating the uncertainty into decision making process and the impact of various factors in the overall performance of the healthcare systems

Analyst-driven development of an open-source simulation tool to address poor uptake of O.R. in healthcare

Computer simulation studies of health and care problems have been reported extensively in the academic literature, but the one-off research projects typically undertaken have failed to create an enduring legacy of widespread use by healthcare practitioners. Simulation and other modelling tools designed and developed to be used routinely have not fared much better either. Following a review of the literature and a survey of frontline analysts in the UK NHS, we found that one reason for this is because simulation tools have, to date, not been developed with the requirements of the end-user in the heart of the development process. Starting with a thorough needs assessment of NHS based healthcare analysts, this study outlines a set of practical design principles to guide development of simulation software tool for conducting patient flow simulation studies. The overall requirement is that patient flow be modelled over a number of inter-connected points of delivery while capturing the stochastic nature of patient arrivals and hospital length of stay, as well as the dynamic delays to patient discharge and transfer of care between different points of care delivery. In ensuring a cost-free solution that is both versatile and user-friendly, and coded in an increasingly popular language among the envisaged end users, the tool was implemented is the R programming language and software environment, with the user interface implemented in the interactive R-Shiny application. The talk will provide an overview of the project lifecycle including an illustrative example of an empirical simulation study concerning the centralisation of an acute stroke pathway

Control of multiclass queueing systems with abandonments and adversarial customers

This thesis considers the defensive surveillance of multiple public areas which are the open, exposed targets of adversarial attacks. We address the operational problem of identifying a real time decision-making rule for a security team in order to minimise the damage an adversary can inflict within the public areas. We model the surveillance scenario as a multiclass queueing system with customer abandonments, wherein the operational problem translates into developing service policies for a server in order to minimise the expected damage an adversarial customer can inflict on the system. We consider three different surveillance scenarios which may occur in realworld security operations. In each scenario it is only possible to calculate optimal policies in small systems or in special cases, hence we focus on developing heuristic policies which can be computed and demonstrate their effectiveness in numerical experiments. In the random adversary scenario, the adversary attacks the system according to a probability distribution known to the server. This problem is a special case of a more general stochastic scheduling problem. We develop new results which complement the existing literature based on priority policies and an effective approximate policy improvement algorithm. We also consider the scenario of a strategic adversary who chooses where to attack. We model the interaction of the server and adversary as a two-person zero-sum game. We develop an effective heuristic based on an iterative algorithm which populates a small set of service policies to be randomised over. Finally, we consider the scenario of a strategic adversary who chooses both where and when to attack and formulate it as a robust optimisation problem. In this case, we demonstrate the optimality of the last-come first-served policy in single queue systems. In systems with multiple queues, we develop effective heuristic policies based on the last-come first-served policy which incorporates randomisation both within service policies and across service policies

Fuelling the zero-emissions road freight of the future: routing of mobile fuellers

The future of zero-emissions road freight is closely tied to the sufficient availability of new and clean fuel options such as electricity and Hydrogen. In goods distribution using Electric Commercial Vehicles (ECVs) and Hydrogen Fuel Cell Vehicles (HFCVs) a major challenge in the transition period would pertain to their limited autonomy and scarce and unevenly distributed refuelling stations. One viable solution to facilitate and speed up the adoption of ECVs/HFCVs by logistics, however, is to get the fuel to the point where it is needed (instead of diverting the route of delivery vehicles to refuelling stations) using "Mobile Fuellers (MFs)". These are mobile battery swapping/recharging vans or mobile Hydrogen fuellers that can travel to a running ECV/HFCV to provide the fuel they require to complete their delivery routes at a rendezvous time and space. In this presentation, new vehicle routing models will be presented for a third party company that provides MF services. In the proposed problem variant, the MF provider company receives routing plans of multiple customer companies and has to design routes for a fleet of capacitated MFs that have to synchronise their routes with the running vehicles to deliver the required amount of fuel on-the-fly. This presentation will discuss and compare several mathematical models based on different business models and collaborative logistics scenarios