Skip to main content
Springer logoLink to Springer
. 2026 Feb 19;29(1):7. doi: 10.1007/s10729-025-09743-5

Optimization of tray inventory levels in hospitals from an integral perspective

Hayo Bos 1,3,, Gaspard Hosteins 2, Wick Wijnholds 4, Aleida Braaksma 3,4, Gréanne Leeftink 3,
PMCID: PMC12920321  PMID: 41712105

Abstract

Surgical instrument trays are crucial for any hospital’s surgical department; patients cannot undergo surgery if the right instruments are not available. It is therefore of great significance to provide a steady and sufficient supply of sterile medical devices to the surgery department, which can be guaranteed by having sufficient inventory of sterile trays. However, the value of surgical tray inventory is substantial, and given the pressure on the health care industry to reduce cost, a properly aligned tray inventory is of utmost importance. Choosing the appropriate tray inventory levels is hard due to the complex interplay between the surgical schedule and the sterilisation cycle. In this paper, we propose a practice-driven heuristic and a Discrete Event Simulation (DES) model to choose and evaluate the appropriate tray levels respectively. We propose a novel surgery schedule generation algorithm to account for the dependency in tray demand, which has not been addressed in literature thus far. Using a case study from our partnering hospital, we show that without compromising quality, the tray inventory can safely be reduced by 28%.

Keywords: Integral planning, Hospital sterilisation, Simulation, Healthcare management, RMD cycle, Tray inventory management

Highlights

  • Our study focuses on optimizing stock levels of surgical instrument trays.

  • We propose a new heuristic, which we benchmark against the state of the art.

  • We develop a Discrete Event Simulation model of the Central Sterilisation Services department of our partnering hospital.

  • We propose a new surgery generation algorithm to account for the variability in the demand for surgical instruments.

  • We show that we can reduce tray stock levels by 28% without increasing cancellations or rescheduled surgeries.

Introduction

Sterilisation services are a key part of hospital operations [1]. All surgeries require trays consisting of a fixed configuration of Reusable Medical Devices (sRMDs), which after usage, have to undergo sterilisation before they can be used again. Without ample tray inventory and a well-organised sterilisation process, the surgical schedule may face disruptions or even cancellations: inefficient sterilisation processes may disrupt up to 12% of surgeries due to the lack of supply of surgical tools [2]. Due to ageing populations and budget constraints, hospitals are under increasing pressure to accomplish more with fewer resources. According to Van De Klundert et al. [3], the value of the sterile equipment inventory of hospitals is substantial. Having overly conservative stock levels could therefore heavily impact the hospital’s budget. On the other hand, Viderman et al. [4] show that not having the appropriate equipment available also leads to, among others, waste of resources, financial burden and patient dissatisfaction.

Our partnering hospital is a medium-sized Dutch hospital which uses stock levels which are historically determined, mostly based on (educated) guesses by doctors and management. The hospital aims to expand to face the growing demand for healthcare in the Netherlands. As surgery trays are a vital resource and a hard requirement to facilitate such growth, this motivated us to study the tray stock levels; next to the strong anecdotal evidence that the current levels were suboptimal. During site visits we observed many tray types of which trays had been untouched for a long time, while there was an acute need of other tray types due to insufficient stock. The goal is therefore to develop a method to determine the right stock levels ensuring availability of surgical equipment while preventing wastage of resources. The underlying complexity of the sterilization cycle and tray demand requires a thorough analysis and the development of novel models.

The organization of sterilization services varies. Sterilization services can be centralized, outsourced, or pooled [5, 6]. The common denominator of the organization of sterilization services is that it constitutes a cyclic system, in which, after usage, the trays of RMDs have to undergo sterilization before they can be used again. Our goal is to optimize tray inventory in the Central Sterilisation Service (CSS) context. There is a vast amount of literature on inventory management, see, e.g., [7], but due to the cyclic, complex nature of the CSS, those methods can not be applied. Besides, the demand for surgical trays is largely dictated by the surgical schedule. Since a single surgery often requires multiple trays of various types, tray demand tends to be interdependent, a phenomenon further amplified by surgeon preferences. In contrast, the literature typically assumes demands to be independent. Hence, there exists a disparity between conventional inventory optimization techniques and the optimization of inventory for surgical trays, as indicated in [1]. This is the gap we aim to bridge in this paper.

The key contribution of our work is a holistic framework to determine and assess resource usage at the CSS. Contrary to, e.g., [2, 8], this work takes into account all the components of the surgical tray cycle, thus beyond the sole analysis of the CSS alone. As part of this framework, we propose a surgical schedule generation algorithm, to model the demand for trays from surgery and the outpatient clinic. To the best of our knowledge, this is the first time such a procedure has been included in a DES model of the tray cycle. An important challenge is to determine the appropriate tray stock levels. We propose a practice driven heuristic, which we validated by a comprehensive DES model of a hospital’s surgical tray flow. We compare our heuristic against far more complicated heuristics from recent literature, and show its superior performance. Concluding, we propose a new simulation-based CSS performance evaluation framework, a surgery generation algorithm and a tray inventory optimization heuristic. We show our heuristic’s superior performance using our holistic simulation framework.

In what follows we review the existing literature in Section 2. In Section 3, we describe a general CSS layout and introduce our DES model. Section 4 introduces our inventory optimization heuristic and two heuristics from literature to benchmark against. In Section 5 we present numerical results obtained from calibrating our DES model and applying the heuristics to a partnering hospital, and in Section 6 we summarize our findings, draw conclusions, and discuss potential future work.

Literature review

The literature on hospital sterilisation services in Operations Management (OM) and Operations Research (OR) is broadly classified into three categories: tray design, flow analysis/optimisation and inventory management.

A large part of the literature dedicated to the sterilisation department focuses on the design of trays, i.e., the blueprint telling which and how many RMDs are in a tray of a certain type. Cardoen et al. [9] proposed that the grouping of RMDs in trays could be formulated as an NP-hard set-covering problem, and various cost-optimisation-based packing strategies have been proposed [912]. Moreover, Dobson et al. [10] noted that the optimal design of trays depends on the surgical schedule. Reymondon et al. [13] studied the delayed differentiation of trays. Tray inventory decisions are considered in Dobson et al. [10], while most other literature assumes infinite inventory and focuses on the optimal set covering minimising costs [9, 11, 12].

A second stream of research in the field of sterilisation focuses on flow analysis and optimisation. Di Mascolo and Gouin [8] and Lin et al. [14] proposed simulation modelling approaches to reduce the sterilisation time, from tray arrival in the CSS to sterile storage. A key component of those models is how surgical tray demand is addressed. A common approach is to use historical surgical schedules to evaluate the system’s performance [2, 14]. A drawback of this approach is that potential adjustments are only found retrospectively, and more generic models are needed to devise and validate improvements. A step in this direction is set by Di Mascolo and Gouin [8], who modelled the number of surgeries and the number of trays used as Poisson processes. They, however, lacked a clear link between tray demand and surgery type, preventing the proposed model to use information about the surgical schedule to optimise the sterilisation operation. As up to 90% of surgeries are typically scheduled more than a day in advance [13], the surgical schedule can also be used on an operational level to improve operations, as is done in [8, 13, 15, 16]. Rupnik et al. [2] propose to improve the surgery schedule to reduce CSS bottlenecks, tray stock-outs, and subsequently, surgery perturbations.

In terms of inventory management, research has focused on optimising tray stock levels to minimise purchasing and holding costs [17], and the arrival of sterile trays from an inventory management perspective [3]. Using Markov chains, Diamant et al. [18] developed an approach that calculates the service level for different instrument base stocks in an outsourced sterilisation setup, where trays are sent for sterilisation and become available again 2 days later. Other inventory approaches considered service levels and hospital-specific constraints but are not specifically designed for trays and would need to be adapted to take into account the circular nature of the RMD usage [1921]. To the best of our knowledge, no previous approach has considered the entire tray cycle, specifically the sterilisation process, when determining the appropriate levels of tray inventory.

To the best of our knowledge, there is no prior work that combines the surgical schedule and sterilisation process information to optimise tray inventory. There is, from a practical point of view, need for straightforward methods to find the appropriate inventory levels, taking the system’s complexity into account. Our approach aims to build a generic simulation model for the sterilisation flow. We incorporate the surgical schedule, which altogether allows for generating long runs and different replications, assessing the effect of demand stochasticity and, therefore, generating insights in the effects of different inventory levels. Building on Rupnik et al. [2], our goal is to improve the sterilisation process, but in a more integrated and holistic manner, including the surgeries and the inventory management to the analysis of the CSS.

Simulation model

This section presents the proposed simulation model. In Section 3.1, we describe the sterilisation process. In Section 3.2, we translate this process into components which can easily be modelled in most modern DES simulation software. Our surgical schedule generating algorithm dictating the flow of the cycle is explained in Section 3.3. Lastly, Section 3.4 introduces the Key Performance Indicators (sKPIs) to measure the system’s performance.

Process description of the tray cycle

An in-house CSS facility typically consists of three compartments: a decontamination space, a preparation and packing space, and storage [6]. The decontamination space and preparation space are physically separated with trays moving from one to another via disinfection machines. Similarly, the preparation space and storage are physically separated, with trays moving from one to another via autoclaves. The CSS facility is designed such that the risk of contamination is minimised as described by the World Health Organisation report on Decontamination and Reprocessing of Medical Devices for Health-care Facilities [5]. The layout of the CSS is visualised in Fig. 1.

Fig. 1.

Fig. 1

Conceptual model of the sterilisation process

Surgical trays are requested from storage and used for surgical procedures, after which they are sent to the CSS to be cleaned and restocked. In some configurations trays are collected first and sent to the CSS in batches, for instance when used in the outpatient clinic. The trays arrive in the decontamination space. The sterilisation process is composed of several subsequent steps, some of which are manual, others machinated. First, the trays are disassembled into RMDs and pre-cleaned, either manually or automatically, to remove coarse dirt from the RMDs. Following pre-cleaning, the RMDs are loaded and subsequently washed in disinfection machines, after which the trays are unloaded and moved to the preparation space. The RMDs are subsequently manually assembled in their correct tray configurations. The assembly stage includes a check of all tools for maintenance and/or replacement in case of damage, as explained by Fineman and Kapadia [17]. The trays are then manually wrapped in special paper and loaded and sterilised in autoclaves. Afterwards, the trays are restocked in the storage facility.

While the above describes the general layout of CSSs, there frequently are local exceptions. Examples include CSS facilities which also provide sterilisation services to satellite locations or outpatient clinics to which batch transportation has to be arranged [22]. As another example, in certain CSS facilities, not all tray types are allowed to be combined in one disinfection machine charge; trays used for eye surgery and for anaesthetic purposes are to be disinfected separately.

Model components

The resources of the tray cycle consist of surgical trays, machines, workstations, and staff. The tray inventory can be described by a set Inline graphic of tray types, together with a corresponding inventory Inline graphic, capturing the inventory per type s. Typically, hospitals have different sized trays. The spatial dimensions of trays are important at various points in the sterilisation cycle, e.g., in the disinfection machines and autoclaves. To reflect this, we introduce a size parameter Inline graphic, recording the size of each tray. Trays usually have a fixed size, and hospitals typically use several sizes.

There are three types of workstations, where trays are pre-cleaned, assembled or wrapped. Let Inline graphic, Inline graphic and Inline graphic indicate the number of available workstations with tray capacity Inline graphic and Inline graphic, respectively. As these tasks are performed manually, we allow the durations to be uncertain by modelling them using the lognormal distribution, where each workstation type has individual parameters, as is customary in literature [2325]. The same holds for the loading and unloading processes of the disinfection machines and autoclaves.

There are two types of machines: the disinfection machines and autoclaves, of which there are Inline graphic and Inline graphic available. The durations of a washing or sterilising charge are pre-set, and can therefore be considered to be deterministic. In front of all workstations and machines, trays are stacked in queues. All these queues operate as First In First Out (FIFO) queues with infinite capacity. Both machines and work stations have a service capacity Inline graphic and Inline graphic respectively, dictating the maximum number of trays which can simultaneously receive service.

The staff is divided over two teams, one working in the preparation space (pre-cleaning) and the other in the decontamination space (post-cleaning). The CSS staff works in shifts. A shift on day t is encoded by Inline graphic), which represents a shift that starts at time Inline graphic and ends at time Inline graphic. The number of employees scheduled on a shift is denoted by Inline graphic for pre-cleaning, and Inline graphic for post-cleaning. In general, all staff members are multi-skilled and can perform every task, but transitioning between both spaces requires changing clothes for hygienic reasons. This is why the number of transitions between both spaces should ideally be minimized. The information in this section is summarised in Table 1. To model the batch arrivals from, e.g., outpatient clinic and potential satellite locations, we use batch queues as depicted in Fig. 1. Between the arrival times of the batches, all trays are collected and queued and inserted into the rinsing queue at the preset batch arrival insertion times Inline graphic.

Table 1.

Required parameters per resource for CSS simulator

Resource
Tray types Inventory Size
Trays Inline graphic Inline graphic Inline graphic
Quantity Distribution Mean Std Queue Capacity
Workstations
Rinsing Inline graphic Lognormal Inline graphic Inline graphic FIFO / Inline graphic Inline graphic
Resetting Inline graphic Lognormal Inline graphic Inline graphic FIFO / Inline graphic Inline graphic
Wrapping Inline graphic Lognormal Inline graphic Inline graphic FIFO / Inline graphic Inline graphic
Disinfection Inline graphic FIFO / Inline graphic Inline graphic
Charge Deterministic Inline graphic
Loading Lognormal Inline graphic Inline graphic
Unloading Lognormal Inline graphic Inline graphic
Sterilisation Inline graphic FIFO / Inline graphic Inline graphic
Charge Deterministic Inline graphic
Loading Lognormal Inline graphic Inline graphic
Staff Day Shifts Quantity
Pre-cleaning t Inline graphic Inline graphic
Post-cleaning t Inline graphic Inline graphic

Surgery process

The pace of the tray cycle is dictated by the surgical schedule, as it both determines the tray demand as well as the arrival time of trays at the CSS. In practice, surgery schedules are frequently developed in several steps by different departments, and are subject to many historical and practical constraints. This makes it hard to exactly replicate the generation of the surgery schedule, as there are many, hard-to-model manual steps involved based on the planners’ expertise. We therefore present a historical data driven surgical schedule generation Algorithm 1 below, which we composed based on the current scheduling logic, together with Subject Matter Experts (sSMEs).

Algorithm 1.

Algorithm 1

Surgery generation algorithm.

The algorithm requires several inputs including the simulation run length, surgery types Inline graphic, tray configurations Inline graphic, containing the feasible subsets of trays per surgery type, operating rooms Inline graphic, surgery durations Inline graphic, and average frequency per surgery per day of the week Inline graphic, all of which are obtained from the source data. Note that a set of tray configurations Inline graphic can consist of multiple sets of multiple tray types s. The algorithm’s output is a schedule per operating room detailing the surgeries, their start times, and preferred tool configurations.

In Step 3, we initialise the schedule for each operating room o and day t. We generate a schedule for each day t up to the run length. For each day, we initialise the list of surgeries to be scheduled for that day Inline graphic as an empty set and set the expected total surgery duration Inline graphic to 0. The day of the week corresponding to t is determined in Step 7.

Subsequently, for each surgery type Inline graphic, we draw the number of surgeries of type s to be performed on day t in Step 9 using a Poisson distribution, as is done for scheduled arrivals in [26]. The surgery durations are modelled using a lognormal distribution in Step 11, as is common in surgery scheduling literature (see e.g., Zhu et al. [27], May et al. [28], or Schneider et al. [29]). We draw the preferred configuration in Step 12. All surgeries of each surgery type are added to Inline graphic in Step 13. Next, we iterate over the list of surgeries to schedule, in each iteration searching for the Operating Room (OR) with the smallest value Inline graphic, i.e., the OR with the most remaining time, in Step 15. Note that this corresponds to a worst-fit heuristic as defined in Shi et al. [30]. Subsequently, we update Inline graphic in Step 17 by adding the expected duration of surgery o. In the last loop, we randomly shuffle the order of surgeries and adjust the starting times of the surgeries such the start times of the surgeries are spread evenly over the day in Step 21. This way, we ensure that tray arrivals are spread over the day, which resembles the actual situation (Table 2).

Table 2.

Required data for the arrival process parameters of trays

Data
Surgery types Inline graphic
Configurations Inline graphic
Surgery durations Inline graphic

The DES model executes surgeries per the schedule generated by Algorithm 1. Each surgery is assigned a tray configuration. Surgeries may require multiple trays, and varying configurations of trays may be employed for the same surgery type. By mapping the trays to the surgery demand, we factor in the interdependence of tray demand between those typically used for the same surgeries or scheduled surgeries within the same day. However, if one or more of the trays in the configuration are not at hand, the simulation will iterate over the list of feasible configurations for that surgery, Inline graphic, to check if any other configuration is feasible. If this is the case, the surgery is executed as scheduled with an alternative configuration. If this is not the case the simulation will check availability for at most two hours, after which the simulation cancels surgery is cancelled.

Performance measurement

Our proposed approach focuses on evaluating the tray inventory levels on the performance of the tray cycle within a hospital. The goal is to ensure that surgeries proceed as planned, while having no more trays in stock than necessary. We therefore consider three equally important performance KPIs, being the alternative tray percentage, reschedule percentage, and the inventory level.

These are the proportion of surgeries that had to be performed with replacement trays, the proportion of surgeries that are rescheduled due to tray unavailability and the total number of trays in inventory, respectively. The first two are KPIs that reflect the continuity of the operations in the surgical department and are also used by, e.g., [18], and the last KPI reflects on the efficiency of the tray inventory itself.

To validate the simulation model, we additionally consider several validation KPIs, which are the average queue lengths before the various workstations and machines, the number of disinfection and sterilisation charges, and the total number of trays cleaned. All KPIs are summarised in Table 3.

Table 3.

Performance and validation KPIs and their definitions

KPI Definition
Alternative tray percentage The proportion of surgeries that had to be performed
with replacement RMDs.
Reschedule percentage The proportion of surgeries that are rescheduled due to RMD unavailability.
A delay in availability of RMD sets of more than 2 hours
results in a rescheduled surgery.
Total inventory level The total number of trays in the tray inventory.
Average queue lengths The average number of trays in the queue before the workstation or machine.
Number of charges The number of disinfection machine or autoclave charges.
Total number of trays cleaned The total number of trays that completed the full sterilisation
cycle during the simulation run.

Heuristics

To determine appropriate tray stock levels, we propose a straightforward and easy-to-interpret heuristic, which we benchmark against two heuristics from literature. We first introduce our heuristic in Section 4.2, and subsequently summarise the benchmark heuristics presented in [17] in Section 4.3 and the heuristic presented in [18] in Section 4.4. As stated in the introduction, the tray demand is not independent over all trays, as it is driven by the surgery schedule. To circumvent this issue, we use Algorithm 1 to generate the surgical schedule and subsequent tray demand, where we estimate the distribution of the tray demand using its empirical counterpart.

Notation

Let Inline graphic, denote the total quantity of tray type s currently present in the system. With a slight abuse of terminology, we refer to this quantity as the tray inventory level. Note that these trays can be at any of the stages depicted in Fig. 1. Furthermore, let Inline graphic denote the tray demand for tray type s at time t. In this section, we propose three heuristics to optimize Inline graphic. We denote the optimized tray level using a superscript corresponding to each heuristic, i.e., Inline graphic is the optimal tray level level for tray type s under heuristic H.

Base-stock heuristic

We introduce the Base Stock (BS) heuristic, in which tray type stock levels are set using demand data. This heuristic considers a daily timescale, i.e., we define the tray type demand at day of the week v, Inline graphic, to be the number of times a tray from tray type s is requested at weekday v. Due to the stochasticity of the surgical schedule, Inline graphic can be modelled as a random variable. Let Inline graphic denote its Cumulative Distribution Function (CDF). In the base-stock heuristic, we set the stock level per tray type, Inline graphic to the maximum over all weekdays v of the Inline graphic-th percentile of the distribution of Inline graphic, i.e.,

graphic file with name d33e1252.gif 1

Fineman and kapadia

Fineman and Kapadia [17] propose a heuristic we refer to as FK, that relates daily tray type demand Inline graphic with the tray cycle time Inline graphic, measured in days. They propose to set the required stock level of tray type Inline graphic, Inline graphic, to

graphic file with name d33e1280.gif 2

This heuristic is not directly applicable to our case, as we assume both Inline graphic and Inline graphic to be stochastic, and Inline graphic can differ per day t. We therefore propose to replace Inline graphic by its expected value Inline graphic and Inline graphic by its mean, median and max over all days t, resulting in Inline graphic, Inline graphic and Inline graphic respectively:

graphic file with name d33e1329.gif 3

where Inline graphic denotes the median of its argument, and Inline graphic is the ceiling function.

Diamant et al.

Diamant et al. [18] propose a Markov Chain based heuristic to find the appropriate inventory levels, which we refer to as DI. We consider tray type s. We discretize the time horizon into time periods of equal length. Let k denote the k-th period of time. Note that a day t may consist of multiple time periods. Diamant et al. [18] assume that inventory can be either sterilised (thus ready-to-use), or dirty, and that at period Inline graphic, all inventory is sterilised. They also assume that any trays used in period k are sterilised in period Inline graphic and ready to be used again at the start of period Inline graphic. Let Inline graphic be the total amount of inventory of tray type s in the system. Similar to the heuristics presented in Sections 4.2 and 4.3, the aim is to find the optimal stock level, Inline graphic.

Let Inline graphic denote the on hand, ready-to-use sterilised inventory of tray type s at the beginning of period k. Let Inline graphic denote the number of to-be-sterilised type s trays at the end of period k. We obtain

graphic file with name d33e1421.gif 4

where Inline graphic. As we can never use more inventory than we have on hand, the ‘dirty’ inventory at the end of the period is Inline graphic. Note that the total inventory is constant, i.e., that Inline graphic; inventory is either on-hand or being cleaned. The relation between Inline graphic, Inline graphic and Inline graphic is as follows:

graphic file with name d33e1451.gif 5

It follows that Inline graphic is a discrete-time Markov Chain, with transition probabilities Inline graphicInline graphic, which depend on the demand distribution. Let Inline graphic denote the steady-state probability distribution of the Markov Chain given a total tray type s inventory of Inline graphic. Assume i.i.d. demand Inline graphic over all periods k. Diamant et al. [18, Lemma 1] provides a closed-form solution for Inline graphic and Inline graphic:

graphic file with name d33e1498.gif 6

The complete steady state distribution can be obtained by recursion, see [18, Proposition 1]

graphic file with name d33e1506.gif 7

Let the service level denote the probability that demand does not exceed ready-to-use inventory. For a preset service level Inline graphic, the corresponding inventory level Inline graphic is found by solving:

graphic file with name d33e1520.gif 8

Experiments and computational results

In this section we present the numerical results of our study. Section 5.1 presents the instance based on our partnering hospital. We validate our simulation model in Section 5.2, and apply the proposed heuristics in Section 5.3.

Case study

This research is conducted at a medium-sized hospital with a main location and a sattelite location in the Netherlands. This hospital has approximately 500 beds, and an in-house CSS at the main location serving both its main and sattelite location. To ensure comprehensive data for this study, an extensive analysis was conducted using the hospital’s Enterprise Resource Planning (ERP) system. We retrieved data of 2021, and after excluding data related to COVID-19 pandemic restrictions in the Netherlands, a total of 28 weeks of data were used. To complement and enhance the data, on-site observations and interviews with the operators involved in the sterilization and tray preparation processes were conducted. This approach allowed for detailed insights into the procedures and activities involved in the process, which may not have been captured in the ERP data. Examples include the duration of rinsing, resetting and wrapping the trays which, and information on the order in which the machines are loaded. We introduce the resources and their parameters in Section 5.1.1, and the surgery process in Section 5.1.2. Section 5.1.3 introduces a clustering of all tray types to facilitate easier analysis.

Resource parameters

The hospital has a tray inventory of 2925 trays, distributed over 1213 tray types. The current tray levels are historically determined and necessarily aligned with surgery demand. Together with an SME, we assigned a size to each tray type. The CSS has two pre-cleaning, two resetting and two wrapping workstations. There are four disinfectors available, as well as three autoclaves. The hospital’s disinfection machine loading rack consists of four layers, each with a capacity of 12 size units, where trays of different sizes are placed. Each disinfection machine has a total capacity of 48 size units. In the autoclave, trays are placed in uniformly sized baskets and the autoclaves are filled according to pure FIFO discipline, with each autoclave having a capacity of 30 trays. The staff works in three shifts on weekdays and one on weekends, and is distributed over the pre-cleaning and post-cleaning area. All necessary information regarding the instance parameters is displayed in Table 4.

Table 4.

Instance parameters based on the partnering hospital

Resource
Tray types Inventory Size
Trays
1213 2925 S,M,L,XL
Quantity Distribution Mean Std Queue Capacity
Workstations
Pre-cleaning 2 Lognormal 1 1.5 FIFO / Inline graphic 1
Resetting 2 Lognormal 2 1 FIFO / Inline graphic 1
Wrapping 2 Lognormal 0.5 0.2 FIFO / Inline graphic 1
Disinfectors 4 FIFO / Inline graphic 48
Charge Deterministic 60
Loading Lognormal 2 0.3
Unloading Lognormal 0.5 0.2
Autoclaves 3 FIFO / Inline graphic 30
Charge Deterministic 60
Loading Lognormal 1 0.3
Day Shifts Quantity
Staff
7.30 AM - 9:45 AM 1
Weekdays 9.45 AM - 5 PM 2
Pre-cleaning 5 PM - 6:30 PM 1
Weekends 8 AM - 12:30 PM 1
7.30 AM - 9:45 AM 6
Weekdays 9.45 AM - 5 PM 9
Post-cleaning 5 PM - 6:30 PM 3
Weekends 8 AM - 1 PM 1

Although its sterilization process fits within the framework of Section 3, there are local differences. The trays from the hospital’s satellite location are transported to the CSS facility in the main location in batches. Besides, not all tray types are allowed to be combined in one disinfection machine charge; trays used for eye surgery and for anaesthetic purposes are to be disinfected separately. Trays are picked from the queue and added to the disinfection machine until the next tray does not fit, then the operators search for the next tray in the queue that fits, repeating until no more trays can be added. Due to hygiene regulations, certain trays, such as those used for anesthetic purposes, are cleaned separately.

As observed on-site, operators do not always wait for a machine to become completely full before starting it. To maintain continuous flow, they start the machines once a minimum quantity has been reached. To reflect this behavior, we introduce thresholds Inline graphic and Inline graphic to ensure that a machine is loaded if it is free and there are enough trays to fill it to at least Inline graphic. These thresholds are calibrated to match the weekly number of machine cycles observed on-site. The risk of tray deterioration and contamination is higher before disinfection, thereby increasing the urgency to process them through the disinfection machines. Trays are safer to store after disinfection and prior to sterilization, explaining the difference in threshold levels for disinfection and sterilization.

Surgery process parameters

To model the demand for the outpatient clinic, we leveraged a dataset of log records containing tray movements within the system, which consisted of 321761 rows extracted from the hospital’s ERP. A sample snapshot of the dataset is presented in Appendix A. We filtered the dataset to isolate trays designated for the outpatient clinic and modeled the demand for the outpatient clinic using a Poisson process. To model the inflow of surgeries at the hospital, we extracted a surgery log data set of 50,860 rows from the hospital’s ERP. A snapshot of the surgery data set and the retrieved input for our model is available in Appendix B. We utilized the surgery log data set to map surgery types to their corresponding tray configurations. Each configuration was assigned a probability based its occurrence per surgery type in the data.

Figure 2 presents the results of our analysis, displaying the number of procedures occurring on each weekday as well as the corresponding volume of tray use. While the majority of trays are used for surgeries, outpatient clinic procedures are the most frequent, representing over 41.8% of the trays used. Therefore, any comprehensive model of the RMD cycle must account for outpatient demand. Similarly to Reymondon et al. [13], Fig. 2 also reveals that only 10.1% of surgeries are emergencies, indicating significant opportunities for planning and prioritization strategies in the RMD sterilization process.

Fig. 2.

Fig. 2

Weekly demand

Clustering

To simplify the analysis, we grouped the tray types into three clusters using a constrained K-means algorithm with feature selection, following the algorithm of Wagstaff et al. [31], Bradley et al. [32]. For each tray type, we calculated the expected weekly demand, the number of surgeries and outpatient clinic procedures requiring that tray type, and the current number of trays of that type in the system. The algorithm generated clusters with a minimum size of 25 tray types, ensuring that we obtained meaningful groups of trays for analysis rather than unmanageable outliers or excessively large clusters that a standard classification algorithm might produce.

Table 5 provides a breakdown of the tray clusters identified through the constrained K-means algorithm. The table shows the number of tray types per cluster, its primary use, the average number of trays in stock per tray type, the average number of procedures for which the tray types in the respective cluster are used, and the expected weekly demand per tray type. Cluster 0 comprises the most frequently used trays in surgeries. These trays have a larger base stock (average of 9.97). Cluster 1 includes all other surgical trays that are less commonly used and more specific to certain types of surgeries. Finally, Cluster 2 consists of all the trays used in outpatient clinics.

Table 5.

Constrained K-means analysis: Tray types clustering

Cluster Number of Use Current stock Number of Expected weekly demand
tray types per tray type procedures per tray type
0 32 Surgeries 9.97 59.94 13.98
1 771 Surgeries 2.15 5.50 0.78
2 410 Outpatient 2.35 1 1.88

Model validation

We built the DES model in Python (3.10), using SimPy (4.0.1), a process-based discrete-event simulation framework (see SimPy [33], Matloff [34]). The simulation experiments, consisting of 30 replications, a six-week warm-up period and 104 weeks of run length, were run on a Linux cluster with a Xeon Gold 6226R processor and 756GB of memory. Where possible, replications were parallelised across 30 cores to reduce computational time, and each experiment took approximately 50 minutes to run.

To determine the simulation’s warm-up period, we use MSER-m heuristic, introduced by White [35] and White et al. [36] to determine the optimal truncation point for minimising the marginal confidence interval and reducing bias. The MSER-m method uses groups of m data points to perform the analysis, increasing its robustness in removing bias [36]. In this analysis, the simulation output data points were already grouped by weeks to account for daily variations, and groups of 2 data points (MSER-2) were used instead of the more common 5 data points (MSER-5), as 5 weeks provided too broad a granularity.

The results of the MSER-2 analysis are presented in Table 6. This experiment consisted of 10 replications and a 3-year (156-week) run length. For each KPI, the table shows the minimal truncation point, which corresponds to the warm-up data that should be excluded from the output analysis to eliminate the initial bias. The alternative tray percentage has the largest truncation point of four weeks, and a conservative approach was taken by using a warm-up period of 6 weeks to remove the initial bias for all KPIs. In addition, Table 6 displays the corresponding marginal 95% confidence interval for each outcome.

Table 6.

Warm-up period: Results of the MSER-2 analysis

KPI Optimal truncation 6 weeks Truncation
Inline graphic 95% CI Width in % of mean 95% CI Width in % of mean
Alternative tray Perc. 4 Inline graphic Inline graphic Inline graphic Inline graphic
Rescheduling Prob. 2 Inline graphic Inline graphic Inline graphic Inline graphic
Pre Cleaning queue 2 Inline graphic Inline graphic Inline graphic Inline graphic
Disinfection queue 2 Inline graphic Inline graphic Inline graphic Inline graphic
Assembly queue 2 Inline graphic Inline graphic Inline graphic Inline graphic
Wrapping 2 Inline graphic Inline graphic Inline graphic Inline graphic
sterilization 2 Inline graphic Inline graphic Inline graphic Inline graphic

To minimise the computational impact of the warm-up period of 6 weeks, a run length of 2 years (104 weeks) added to the 6 weeks of warm-up was used, as recommended by Robinson [37], which reduces the need for replications and therefore warm-up periods. To determine the appropriate number of replications, an experiment of 100 replications was conducted to study the convergence and the width of the 95% confidence interval for the KPIs. As demonstrated by Fig. 3 using the average queue length ahead of pre-cleaning as an example, 30 replications are sufficient to observe convergence of the average values and the 95% confidence interval. This pattern holds for all KPIs, ensuring that 30 replications are adequate to eliminate any bias caused by stochasticity and ensure a steady state.

Fig. 3.

Fig. 3

Pre-cleaning queue length cumulative mean and confidence interval by number of replications

Table 7 displays the 95% confidence intervals obtained from 30 replications. For the majority of the indicators, the confidence intervals are relatively tight and provide accurate results. However, the interval for rescheduling probability is wider. This event is extremely rare with an average of 307.12 occurrences per run (104 weeks). This rarity results in a high volatility in the results and a single event can significantly impact the simulation outcome. We estimate that more than 980 replications would be required to reduce the 95% confidence interval to 5% of the mean value [37]. Although 30 replications may be considered imprecise , it is a trade-off made in consideration of the computational cost that would come with obtaining narrower intervals.

Table 7.

95% confidence interval after 30 replications

KPI Mean 95% CI Width in % of mean
Alternative tray Perc. Inline graphic Inline graphic Inline graphic
Surgery rescheduling Prob. Inline graphic Inline graphic Inline graphic
Pre cleaning queue 9.07 Inline graphic Inline graphic
Disinfection queue 12.1 Inline graphic Inline graphic
Assembly queue 5.52 Inline graphic Inline graphic
Wrapping 0.804 Inline graphic Inline graphic
sterilization 11.0 Inline graphic Inline graphic

The tray makespan, defined as the time elapsed between tray arrival at the CSS and its placement in sterile storage, is computed by our model. Our model provides a median tray makespan of 3 hours and 18 minutes and a Inline graphic percentile of 4 hours and 46 minutes, which have been confirmed by CSS operators and management to closely reflect the actual operations of the CSS.

The CSS does not have precise records of queue lengths or tray-level indicators, so the only available operational data for quantitative validation are the number of trays cleaned per week, and the number of cycles of the autoclaves and disinfection machines. To assess the accuracy of our model, we followed the method proposed by Robinson [38] and calculated the 95% confidence interval of the difference between the means of the simulated output and the operational data extracted from the ERP. The results are presented in Table 8 and show that the confidence interval includes 0, indicating that we do not have sufficient evidence to conclude a significant difference between the simulated output and the operational values.

Table 8.

Means difference analysis between operational data and simulated output

Metric per week Op. Data Simulated Means difference 95% CI
Mean Mean Value % of Op. Mean
Trays cleaned 1770.76 1772.66 Inline graphic Inline graphic
Disinfection cycles 172.76 172.61 Inline graphic Inline graphic
sterilization cycles 99.79 99.14 Inline graphic Inline graphic

Tray inventory optimization

This section compares the different tray inventory optimization heuristics as introduced in Section 4. For all heuristics, we used daily demand data obtained from the simulation model. We evaluated the BS heuristic by evaluating Eq. 1 for each tray type for Inline graphic, which we denote as Inline graphic. We evaluated Eq. 3 for the average, median and maximum demand to calculate the stock levels for the FK heuristic, denoted by FKmean, FKmed and FKmax respectively. For all three, we estimated the expectation using the sample mean obtained from simulation. Lastly, we evaluated the DI heuristic using Eq. 8 with an initial period length of 4 hours, for Inline graphic, which we denote as Inline graphic. The results are given in Table 9.

Table 9.

Numerical results for heuristics

Inline graphic Total Reschedule rate Alternative tray perc
inventory
Current 2925 0.04 Inline graphic 0.001 1.20 ± 0.01
BS60 1704 0.15 ± 0.002 4.72 ± 0.03
BS65 1757 0.11 ± 0.002 3.98 ± 0.02
BS70 1824 0.08 ± 0.002 3.03 ± 0.02
BS75 1898 0.06 ± 0.001 2.44 ± 0.04
BS80 1986 0.05 ± 0.001 1.94 ± 0.01
BS85 2092 0.03 ± 0.001 1.38 ± 0.01
BS90 2273 0.03 ± 0.001 0.87 ± 0.01
BS95 2713 0.01 ± 0.001 0.38 ± 0.01
FKmed 1217 2.07 ± 0.01 45.64 ± 0.03
FKmean 1216 2.05 ± 0.003 45.44 ± 0.03
FKmax 1228 1.86 ± 0.01 40.50 ± 0.02
DI96 1453 0.32 ± 0.002 11.47 ± 0.05
DI97 1480 0.30 ± 0.001 10.47 ± 0.03
DI98 1549 0.25 ± 0.002 7.97 ± 0.02
DI99 1652 0.16 ± 0.001 5.79 ± 0.02
DI99.5 1774 0.09 ± 0.001 3.64 ± 0.04
DI99.9 2086 0.03 ± 0.001 1.46 ± 0.02
DI99.95 2243 0.02 ± 0.0004 0.88 ± 0.01
DI99.99 2756 0.004 ± 0.0004 0.38 ± 0.01

As can be seen in Table 9, the BS heuristic performs significantly better than the current inventory policy. For example, for Inline graphic, the reschedule rate is lower than the current level, while operating on approximately 28% less inventory. For the FK heuristic, there is little difference between the FKmed and FKmean instances, as one might have expected. Interestingly, the FKmax heuristic performs much better with only just over ten trays more than FKmed and FKmean. The DI heuristic performs very well. Compared to the current situation, DI99.9 has slightly less reschedules, but 28.68% less inventory.

As we touched upon before, the choice of period is quite a critical one when using the Diamant et al. heuristic. An overview of selected simulation results can be found in Fig. 4, where we display the total inventory level obtained from the BS, FK and DI heuristics, the first two for different values of Inline graphic and Inline graphic. We see that the 2, 4 and 6 hour period instances perform similarly when it comes to reschedule percentage, with the 8 and 12 hour periods performing slightly worse. When it comes to alternative tray percentages, the two hour period at points performs worse than even the 24 hour period for similar inventory levels, while the other periods all seem to perform similarly. Given that the median tray sterilization time is 3 hours and 18 minutes, it is no surprise that methods with periods that match that closely generally perform well, since they most closely conform to reality.

Fig. 4.

Fig. 4

Overview of selected simulation results

A key question is how the heuristics change the inventory per tray type. As it is infeasible to display the inventory level per tray type for all 1213 tray types for each of the heuristics, we summarized the results per tray cluster. Figure 5 displays the relative change for each cluster for one instance each for all three heuristics. Each graph displays the frequency of tray alterations (vertical axis) per alteration magnitude (horizontal axis). We observe that the alteration patterns are similar for the BS and DI heuristics. Furthermore, for these heuristics the graphs show that inventory levels can safely be lowered for many tray types in cluster 0, while maintaining similar overall performance by increasing the inventory in a relatively low (approx. 10%) number of tray types, mostly in Cluster 1 and 2.

Fig. 5.

Fig. 5

Relative inventory change per cluster

We conclude that serious cost savings are possible by re-calibrating the tray inventory using either the BS or DI heuristics. Furthermore, we have shown that our relatively straightforward BS heuristics performs almost similar compared to the much more sophisticated and harder-to-implement DI heuristic.

Managerial insights

The main goal of this work was to establish a method to evaluate and optimize the partnering hospital’s tray stock levels. This section shows that the BS heuristic we propose outperforms more complex ones from literature, which is an important practical insight. The implications of our study are currently being discussed with our partnering hospital’s managers. Implementation of our method is easy from a technical perspective, as it can easily be done using any spreadsheet software. Our results are not yet implemented as, due to the governance structure, a lot of stakeholders need to be convinced before such changed can be implemented. However, the promising potential savings have initiated the discussion of the optimization of the hospital’s tray inventory.

For an analytics project in healthcare to be successful it takes stakeholder engagement, technical performance, implementation and sustained use [39]. This is one of the reasons we purposely propose a simple and understandable method as this would increase the chance of actual implementation in practice. Doing so we prevent creating a so-called black box model, which is known to delay and prevent adaptation of models [40]. Based on these requirements, we formulate the following managerial recommendations for a successful implementation of our results.

  • Use hospital ERP data to tune the simulation model and surgery generation parameters.

  • Together with all stakeholders, which includes managers, medical doctors and CSS specialists, decide upon an acceptable reschedule percentage and alternative tray percentage.

  • Use a figure similar to Fig. 5 to find the right tray inventory levels for the chosen risk level.

Following this route, hospital managers should be able to attain major savings and at the same time increased quality of care.

Conclusion and future work

This study proposes an integrated and holistic approach to optimise the tray inventory of hospitals. We introduce a simple and easy-to-implement heuristic, which we benchmark against two well-known results from literature. Contrary to most work on this topic, we take the full complexity of the cyclic sterilisation system into consideration using a DES model, by which we can account for all sources of variability in the entire process.

The DES model constitutes the entire flow of sterile surgical trays in a hospital, and therefore takes the closed-loop nature of the flow into account. It also includes a novel method to generate surgeries and outpatient procedures, which was key to modelling the entire RMD flow comprehensively. These procedures constituted both the demand for sterile trays and the source of trays to clean, making them critical for understanding the RMD cycle. Incorporating this surgery generation procedure allowed us to comprehensively model the CSS operations and the base stock of the trays.

We apply our DES model and the proposed heuristics to a Dutch partnering hospital. We find that using our heuristic, the hospital can reduce its tray inventory by 28%, which results in significant costs savings, without compromising performance in terms of tray availability. Furthermore, we show that our easy-to-implement method performs almost as good as much more complicated methods from recent literature. We also provide managerial insights following our results, which show the usefulness of our results to other practitioners in the field.

As future work, it would be a valuable addition to the model to incorporate tray composition, thus enabling a more comprehensive analysis of the RMD flow. Additionally, there is potential in using the model to devise surgical planning guidelines aimed at reducing the likelihood of tray stock-outs. We acknowledge that the heuristics we proposed for base stock dimensioning were based on a one-rule-fits-all approach, and that developing finer heuristics tailored to the demand characteristics of each tray type might provide future researchers with a larger reduction for high-use trays and more robustness and safety for low-use ones.

Acknowledgements

The authors acknowledge the Diakonessenhuis Utrecht, the Netherlands, for providing access to the data used in this research. Finally, we extend our gratitude to Dr. Bojan Rupnik from the University of Maribor (UM) for his helpful insights and answers.

Appendix A Snapshot of the tray log dataset extracted from the ERP

Table 10.

A snapshot of the usage log of RMDs in the hospital 

Set ID Set Name Activity Time Date Set Type ID
1 BASE TRAY Reset 10:53:05 19-2-2020 E1
2 COLOSCOPE On OR 10:54:44 19-2-2020 E2
3 SURG.DERMA Wrapping Room 10:57:04 19-2-2020 E3
4 ENDO EYE 0Inline graphic Wrapping Room 10:57:17 19-2-2020 E4
4 ENDO EYE 0Inline graphic Reset 10:57:22 19-2-2020 E4

Source: the hospitals’ ERP system

Appendix B Snapshot of the surgery log dataset extracted from the ERP

Table 11.

A snapshot of the surgery log 

Surg. ID Date Surgery Type OR Tray ID Start End
1 07/04/2021 LAPAROSCOPY DIAGN. UH7 10 19:30 20:32
1 07/04/2021 LAPAROSCOPY DIAGN. UH7 11 19:30 20:32
2 21/12/2021 SECTIO CAESAREA UH6 12 19:00 19:51
3 09/07/2021 URETHROTOMY UH8 13 18:40 19:04
4 14/03/2021 ABCES TRTMNT -(+ PCH) UH8 14 17:23 18:17
5 28/07/2021 URETERORENOSCOPY UH6 15 16:48 17:42
5 28/07/2021 URETERORENOSCOPY UH6 16 16:48 17:42

Source: the hospitals’ ERP system

Declarations

Competing interests

The authors have no competing interests to declare that are relevant to the content of this article.

Ethical Approval

Ethics approval was not needed.

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Hayo Bos, Email: hayobos@gmail.com.

Gréanne Leeftink, Email: a.g.leeftink@utwente.nl.

References

  • 1.Rachuba S, Reuter-Oppermann M, Thielen C (2024) Integrated planning in hospitals: A review. OR Spectrum pp 1–54
  • 2.Rupnik B, Narding R, Kramberger T (2019) Discrete event simulation of hospital sterilization logistics. Tehnicki Vjesnik 26(5):1486–1491. 10.17559/TV-20180614102011
  • 3.Van De Klundert J, Muls P, Schadd M (2008) Optimizing sterilization logistics in hospitals. Health Care Manag Sci 11(1):23–33. 10.1007/s10729-007-9037-4 [DOI] [PubMed] [Google Scholar]
  • 4.Viderman D, Sarria-Santamera A, Umbetzhanov Y, Ismailova A, Ben-David B (2021) Implementation of evidence-based recommendations to reduce elective surgical case cancellations. J Healthcare Quality Res 36(2):59–65. 10.1016/j.jhqr.2020.10.009. Accessed 2024-04-23
  • 5.World Health Organization: Decontamination and reprocessing of medical devices for health-care facilities (2016)
  • 6.Tlahig H, Jebali A, Bouchriha H, Ladet P (2013) Centralized versus distributed sterilization service: A location-allocation decision model. Operations Res Health Care 2(4):75–85. 10.1016/j.orhc.2013.05.001 [Google Scholar]
  • 7.Silver EA, Pyke DF, Thomas DJ (2017) Inventory and Production Management in Supply Chains, Fourth, edition. CRC Press, Taylor & Francis Group, Boca Raton
  • 8.Di Mascolo M, Gouin A (2013) A generic simulation model to assess the performance of sterilization services in health establishments. Health Care Manag Sci 16(1):45–61. 10.1007/s10729-012-9210-2 [DOI] [PubMed] [Google Scholar]
  • 9.Cardoen B, Beliën J, Vanhoucke M (2015) On the design of custom packs: Grouping of medical disposable items for surgeries. Int J Production Res 53(24):7343–7359. 10.1080/00207543.2015.1061221 [Google Scholar]
  • 10.Dobson G, Seidmann A, Tilson V, Froix A (2015) Configuring surgical instrument trays to reduce costs. Iie Trans Healthcare Syst Eng 5(4):225–237. 10.1080/19488300.2015.1094759 [Google Scholar]
  • 11.Reymondon F, Pellet B, Marcon E (2006) Methodology for designing medical devices packages based on sterilisation costs. Ifac Proceedings Volumes (ifac-papersonline) 12(1). 10.3182/20060517-3-fr-2903.00355
  • 12.Reymondon F, Pellet B, Marcon E (2008) Optimization of hospital sterilization costs proposing new grouping choices of medical devices into packages. Int J Product Econ 112(1):326–335. 10.1016/j.ijpe.2006.12.066. Special Section on Recent Developments in the Design, Control, Planning and Scheduling of Productive Systems
  • 13.Reymondon F, Marcon E, Pellet B (2007) Optimisation des stocks de dispositifs médicaux réutilisables par la différenciation retardée. Logistique Manag 15(1):37–48. 10.1080/12507970.2007.11516871 [Google Scholar]
  • 14.Lin F, Lawley M, Spry C, McCarthy K, Coyle-Rogers PG, Yih Y (2008) Using simulation to design a central sterilization department. AORN J 88(4):555–556558561567. 10.1016/j.aorn.2008.03.015 [DOI] [PubMed] [Google Scholar]
  • 15.Ozturk O, Espinouse ML, Di Mascolo M, Gouin A (2010) Optimizing the makespan of washing operations of medical devices in hospital sterilization services. In, (2010) Ieee Workshop on health care management. Whcm 2010:5441278. 10.1109/WHCM.2010.5441278
  • 16.Rossi A, Puppato A, Lanzetta M (2013) Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: Application at a hospital sterilisation plant. Int J Product Res 51(8):2363–2376. 10.1080/00207543.2012.737942 [Google Scholar]
  • 17.Fineman SJ, Kapadia AS (1978) Analysis of the logistics of supplying and processing sterilized items in hospitals. Comput Oper Res 5(1):47–54 [Google Scholar]
  • 18.Diamant A, Milner J, Quereshy F, Xu B (2018) Inventory management of reusable surgical supplies. Health Care Manag Sci 21(3):439–459. 10.1007/s10729-017-9397-3 [DOI] [PubMed] [Google Scholar]
  • 19.Little J, Coughlan B (2008) Optimal inventory policy within hospital space constraints. Health Care Manag Sci 11(2):177–183. 10.1007/s10729-008-9066-7 [DOI] [PubMed] [Google Scholar]
  • 20.Bijvank M, Vis IFA (2012) Inventory control for point-of-use locations in hospitals. J Operational Res Soc 63(4):497–510. 10.1057/jors.2011.52 [Google Scholar]
  • 21.Guerrero WJ, Yeung TG, Guéret C (2013) Joint-optimization of inventory policies on a multi-product multi-echelon pharmaceutical system with batching and ordering constraints. Eur J Oper Res 231(1):98–108. 10.1016/j.ejor.2013.05.030 [Google Scholar]
  • 22.Tlahig H, Jebali A, Bouchriha H, Ladet P (2013) Centralized versus distributed sterilization service: A location-allocation decision model. Operations Res Health Care 2(4):75–85 [Google Scholar]
  • 23.Robb D, Silver E (1993) Scheduling in a management context - uncertain processing times and nonregular performance-measures. Decis Sci 24(6):1085–1108. 10.1111/j.1540-5915.1993.tb00505.x [Google Scholar]
  • 24.Mohan S (2007) A lognormal approximation of activity duration in pert using two time estimates. J Operational Res Soc 58(6):827–831 [Google Scholar]
  • 25.Baker KR, Trietsch D (2009) Principles of Sequencing and Scheduling, Fourth edition edn., pp 1–493. John Wiley and Sons, Hoboken, New Jersey. 10.1002/9780470451793
  • 26.De Bruin AM, Bekker R, Van Zanten L, Koole GM (2010) Dimensioning hospital wards using the Erlang loss model. Ann Oper Res 178(1):23–43 [Google Scholar]
  • 27.Zhu S, Fan W, Yang S, Pei J, Pardalos PM (2019) Operating room planning and surgical case scheduling: a review of literature. J Comb Optim 37(3):757–805 [Google Scholar]
  • 28.May JH, Strum DP, Vargas LG (2000) Fitting the lognormal distribution to surgical procedure times. Decis Sci 31(1):129–148. 10.1111/j.1540-5915.2000.tb00927.x [Google Scholar]
  • 29.Schneider TAJ, Van Essen TJ, Carlier M, Hans EW (2020) Scheduling surgery groups considering multiple downstream resources. Eur J Oper Res 282(2):741–752. 10.1016/j.ejor.2019.09.029 [Google Scholar]
  • 30.Shi P, Dexter F, Epstein RH (2016) Comparing policies for case scheduling within 1 day of surgery by markov chain models. Anesth Analg 122(2):526–538. 10.1213/ANE.0000000000001074 [DOI] [PubMed] [Google Scholar]
  • 31.Wagstaff K, Cardie C, Rogers S, Schrödl S et al (2001) Constrained k-means clustering with background knowledge
  • 32.Bradley PS, Bennett KP, Demiriz A (2000) Constrained k-means clustering. Microsoft Res, Redmond 20(0):0
  • 33.SimPy: SimPy 2002-2020. https://simpy.readthedocs.io/en/latest/index.html. [Online; accessed 7-February-2023] (2002)
  • 34.Matloff N (2008) Introduction to discrete-event simulation and the simpy language. Davis, CA. Dept of Computer Science. University of California at Davis. Retrieved on August 2(2009):1–33
  • 35.White KP (1997) An effective truncation heuristic for bias reduction in simulation output. SIMULATION 69(6):323–334. 10.1177/003754979706900601 [Google Scholar]
  • 36.White KP, Cobb MJ, Spratt SC (2000) A comparison of five steady-state truncation heuristics for simulation. In: 2000 Winter simulation conference proceedings (cat. No.00ch37165) 1:755–601. 10.1109/WSC.2000.899843
  • 37.Robinson S (2014) Simulation: The Practice of Model Development and Use, 2nd edn. Bloomsbury Publishing, London [Google Scholar]
  • 38.Robinson S (1999) Simulation verification, validation and confidence: A tutorial. Trans Soc Comput Simulation 16(2):63–69 [Google Scholar]
  • 39.Scheinker D, Brandeau ML (2020) Implementing analytics projects in a hospital: successes, failures, and opportunities. INFORMS J Appl Anal 50(3):176–189 [Google Scholar]
  • 40.Rudin C (2019) Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat Mach Intell 1(5):206–215 [DOI] [PMC free article] [PubMed] [Google Scholar]

Articles from Health Care Management Science are provided here courtesy of Springer

RESOURCES