Lost-customers approximation of semi-open queueing networks with backordering: An application to minimise the number of robots in robotic mobile fulfilment systems

Research output: Working paperWorking papers

Authors

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.
Original languageEnglish
Place of PublicationNew York
Number of pages44
Publication statusPublished - 03.12.2019

Links

Recently viewed

Publications

  1. Pushing the Envelope: Creating Public Value in the Labor Market
  2. An Interactive Layers Model of Self-Regulated Learning and Cognitive Load
  3. Knowledge transfer during the integration of knowledge-intensive acquisitions
  4. Deciding between the Covariance Analytical Approach and the Change-Score Approach in Two Wave Panel Data
  5. Dynamic efficiency and path dependencies in venture capital markets
  6. Machine Learning Applications in Convective Turbulence
  7. Anomalous Results in G-Factor Models
  8. Teachers’ temporary support and worked-out examples as elements of scaffolding in mathematical modeling
  9. Timing matters: Distinct effects of nitrogen and phosphorus fertilizer application timing on root system architecture responses
  10. Study of Single Filament Dielectric Barrier Discharge in Argon
  11. Clashing Values
  12. Micro and Macro Perspectives in Organization Theory
  13. Technical concept and evaluation design of the state subsidized project [Level-Q]
  14. Towards a Comprehensive Framework for Environmental Management Accounting
  15. Missing links
  16. Does an individualized learning design improve university student online learning? A randomized field experiment
  17. Separable models for interconnected production-inventory systems
  18. Efficacy of a Web-Based Intervention With Mobile Phone Support in Treating Depressive Symptoms in Adults With Type 1 and Type 2 Diabetes
  19. Hacking the Classroom
  20. Mixed Pickels
  21. Combining sense of place theory with the ecosystem services concept: empirical insights and reflections from a participatory mapping study
  22. Dynamic Semantic Web Content for Museum Guides
  23. Knowledge Decolonization à la Grounded Theory
  24. Artificial intelligence
  25. Toward Automatically Labeling Situations in Soccer

Press / Media

  1. I am not a Hacker