We consider a semi-open queueing network (SOQN), where one resource from a resource pool is needed to serve a customer. If on arrival of a customer some resource is available, the resource is forwarded to an inner network to complete the customer’s order. If no resource is available, the new customer waits in an external queue until one becomes available (“backordering”). When a resource exits the inner network, it is returned to the resource pool. We develop a new solution approach. In a first step we modify the system such that new arrivals are lost if the resource pool is empty (“lost customers”). We adjust the arrival rate of the modified system such that the throughputs in all nodes of the inner network are pairwise identical to those in the original network. Using queueing theoretical methods, in a second step we reduce this inner network to a two-station system including the resource pool. For this two-station systems, we invert the first step and obtain a standard SOQN which can be solved analytically. We apply our results to storage and delivering systems with robotic mobile fulfilment systems (RMFSs). Instead of sending pickers to the storage area to search for the ordered items and pick them, robots carry shelves with ordered items from the storage area to picking stations. We model the RMFS as an SOQN to determine the minimal number of robots.
We investigate queueing networks in a random environment. The impact of the evolving environment on the network is by changing service capacities (upgrading and/or degrading, breakdown, repair) when the environment changes its state. On the other side, customers departing from the network may enforce the environment to jump immediately. This means that the environment is nonautonomous and therefore results in a rather complex two-way interaction, especially if the environment is not itself Markov. To react to the changes of the capacities we implement randomised versions of the well-known deterministic rerouteing schemes 'skipping' (jump-over protocol) and `reflection' (repeated service, random direction). Our main result is an explicit expression for the joint stationary distribution of the queue-lengths vector and the environment which is of product form.
We investigate a new class of separable systems which exhibit a product-form stationary distribution. These systems consist of parallel production systems (servers) at several locations, each with a local inventory under base stock policy, connected with a common supplier network. Demand of customers arrives at each production system according to a Poisson process and is lost if the local inventory is depleted (“lost sales”). To satisfy a customer’s demand a production server needs raw material from the associated local inventory. The supplier network is a classical queueing network. We investigate two different lost sales regimes, either based on total inventory or on available inventory. We perform cost analysis to find the optimal base stock levels, which is due to the product-form stationary distribution a separable optimization problem. Finally, we demonstrate that the explicit product forms for both stationary distributions enable us to compare main performance metrics of the systems under the different lost sales admission regimes.