Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems
From MaRDI portal
(Redirected from Publication:2152014)
backorderingwarehousingproduct form approximationlost customersrobotic mobile fulfilment systemsemi-open queueing network
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Abstract: We consider a semi-open queueing network (SOQN), where a customer requires exactly one resource from the resource pool for service. If there is a resource available, the customer is immediately served and the resource enters an inner network. If there is no resource available, the new customer has to wait in an external queue until one becomes available ("backordering"). When a resource exits the inner network, it is returned to the resource pool and waits for another customer. In this paper, we present a new solution approach. To approximate the inner network with the resource pool of the SOQN, we consider a modification, where newly arriving customers will decide not to join the external queue and are lost if the resource pool is empty "lost customers". We prove that we can adjust the arrival rate of the modified system so that the throughputs in each node are pairwise identical to those in the original network. We also prove that the probabilities that the nodes with constant service rates are idling are pairwise identical too. Moreover, we provide a closed-form expression for these throughputs and probabilities of idle nodes. To approximate the external queue of the SOQN with backordering, we construct a reduced SOQN with backordering, where the inner network consists only of one node, by using Norton's theorem and results from the lost-customers modification. In a final step, we use the closed-form solution of this reduced SOQN, to estimate the performance of the original SOQN. We apply our results to 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, analyse its stability and determine the minimal number of robots for such systems using the results from the first part.
Recommendations
- Solving semi-open queuing networks
- Estimating performance in a robotic mobile fulfillment system
- Dynamic policies for resource reallocation in a robotic mobile fulfillment system with time-varying demand
- On The Interrelationship Between Semi-Open and Closed Queueing Network Models For Flexible Manufacturing System
- Joint optimization of order sequencing and rack scheduling in the robotic mobile fulfilment system
Cites work
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 3602674 (Why is no real title available?)
- A logarithmic reduction algorithm for quasi-birth-death processes
- AMVA-based solution procedures for open queueing networks with population constraints
- An open queuing network-based tool for performance estimations in a shuttle-based storage and retrieval system
- Approximate Queuing Models for Multiprogramming Computer Systems
- Dynamic policies for resource reallocation in a robotic mobile fulfillment system with time-varying demand
- Estimating performance in a robotic mobile fulfillment system
- Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Jackson networks in nonautonomous random environments
- Lost-sales inventory theory: a review
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Parametric Analysis of Queuing Networks
- Queueing Networks and Markov Chains
- Solving semi-open queuing networks
- The preservation of likelihood ratio ordering under convolution
- Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
- Warehousing in the e-commerce era: a survey
- \(M/M/1\) queueing systems with inventory
Cited in
(4)- Solving semi-open queuing networks
- Product form solutions of some queueing inventory problems in random environment
- Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems
- Analysis of semi-open queueing network with correlated arrival process and multi-server nodes
This page was built for publication: Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152014)
