Jan van der Wal

Blood platelet production : optimization by dynamic programming and simulation

Abstract Blood platelets are precious, as voluntarily supplied by donors, and highly perishable, with limited lifetimes of 5–7 days. Demand is highly variable and uncertain. A practical production and inventory rule is strived for that minimizes shortages and spill. The demand and production are periodic, as varying over the seven days of the week. Demand for ‘young’ platelets (oncology and hematology) and demand for platelets of ‘any’ age up to the maximal shelf life (traumatology and general surgery) are distinguished. A combined Markov dynamic programming (MDP) and simulation approach is presented and applied to a real life case of a Dutch blood bank. By down-sizing the dimension and applying this combined approach it is shown that order-up-to type replenishment rules that perform quite well can be found. Particularly, a double-level order-up-to rule, so-called 2D rule, is derived, with one level corresponding to ‘young’ platelets and one to the total inventory. This rule is easy to implement and is shown to be ‘nearly optimal’. This approach and the double order-up-to rule seem to be new. The results are most suitable for sensitivity analyses such as with respect to shortages and production costs for blood platelet inventory management.

Blood platelet production: a novel approach for practical optimization

BACKGROUND: The challenge of production and inventory management for blood platelets (PLTs) is the requirement to meet highly uncertain demands. Shortages are to be minimized, if not to be avoided at all. Overproduction, in turn, leads to high levels of outdating as PLTs have a limited “shelf life.” Outdating is to be minimized for ethical and cost reasons.

Simple Bounds and Monotonicity Results for Finite Multi-Server Exponential Tandem Queues

Simple and computationally attractive lower and upper bounds are presented for the call congestion such as those representing multi-server loss or delay stations. Numerical computations indicate a potential usefulness of the bounds for quick engineering purposes. The bounds correspond to product-form modifications and are intuitively appealing. A formal proof of the bounds and related monotonicity results will be presented. The technique of this proof, which is based on Markov reward theory, is of interest in itself and seems promising for further application. The extension to the non-exponential case is discussed. For multiserver loss stations the bounds are argued to be insensitive.

Upper and lower bounds for the waiting time in the symmetric shortest queue system

In this paper we compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with Threshold Jockeying and the shortest queue system with Threshold Blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bounds for the distribution of the total number of jobs in the system.

Monotonicity of the throughput of a closed queueing network in the number of jobs

Using a sample path argument, it is shown that the throughput of a closed queueing network with general service times is nondecreasing in the number of jobs.

An mdp decomposition approach for traffic control at isolated signalized intersections

This article presents a novel approach for the dynamic control of a signalized intersection. At the intersection, there is a number of arrival flows of cars, each having a single queue (lane). The set of all flows is partitioned into disjoint combinations of nonconflicting flows that will receive green together. The dynamic control of the traffic lights is based on the numbers of cars waiting in the queues. The problem concerning when to switch (and which combination to serve next) is modeled as a Markovian decision process in discrete time. For large intersections (i.e., intersections with a large number of flows), the number of states becomes tremendously large, prohibiting straightforward optimization using value iteration or policy iteration. Starting from an optimal (or nearly optimal) fixed-cycle strategy, a one-step policy improvement is proposed that is easy to compute and is shown to give a close to optimal strategy for the dynamic problem.

DYNAMIC VISIT-ORDER RULES FOR BATCH-SERVICE POLLING

We explore visit-order policies in nonsymmetric polling systems with switch-in and switch-out times, where service is in batches of unlimited size. We concentrate on so-called “Hamiltonian tour” policies in which, in order to give a fair treatment to the various users, the server attends every nonempty queue exactly once during each round of visits (cycle). The server dynamically generates a new visit schedule at the start of each round, depending on the current state of the system (number of jobs in each queue) and on the various nonhomogeneous system parameters. We consider three service regimes, globally gated, (locally) gated, and exhaustive, and study three different performance measures: (1) minimizing the expected weighted sum of all sojourn times of jobs within a cycle; (2) minimizing the expected length of the next cycle, and (3) maximizing the expected weighted throughput in a cycle. For each combination of performance measure and service regime, we derive characteristics of the optimal Hamiltonian tour. Some of the resulting optimal policies are shown to be elegant index-type rules. Others are the solutions of deterministic NP-hard problems. Special cases are reduced to assignment problems with specific cost matrices. The index-type rules can further be used to construct fixed-order, cyclic-type polling tables in cases where dynamic control is not applicable.

Waiting times in queues with relative priorities

This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter.

Platelet pool inventory management: theory meets practice

BACKGROUND: The shelf life of platelet concentrates (PCs) is a matter of days. Simultaneously, the demand is highly variable, shortages are not allowed, and producing too many results in outdating. Concurrently, younger PCs, implying an extended time till outdating (TTO), are preferred. Common PC inventory management relies on experience‐based order‐up‐to rules. This study aimed at minimizing outdating and shortages, while extending the TTO through a theoretical approach. It focuses on PCs processed from whole blood donations.

Optimal threshold policies in a two-class preemptive priority queue with admission and termination control

We consider a two-class