Zobrazeno 1 - 10
of 180
pro vyhledávání: '"BCMP network"'
Publikováno v:
Operations Research. 67:1437-1452
This paper considers a closed queueing network model of ridesharing systems, such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car flow in the network to optimize system-wide utility functions, for e
Autor:
Byron P. Roe
Publikováno v:
Probability and Statistics in the Physical Sciences ISBN: 9783030536930
Probability and Statistics in Experimental Physics ISBN: 9781441928955
Probability and Statistics in Experimental Physics ISBN: 9781441928955
Queueing theory is the theory of standing in lines. We stand in lines waiting for a teller machine at a bank, in checkout lines at grocery stores, and in many other places. Switch computer jobs are in a queue. Processing incoming data events in an ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::017ee972ea8bd3160ebf4e992a266051
https://doi.org/10.1007/978-3-030-53694-7_9
https://doi.org/10.1007/978-3-030-53694-7_9
Publikováno v:
The International Journal of Robotics Research. 38:357-374
In this paper we present a queueing network approach to the problem of routing and rebalancing a fleet of self-driving vehicles providing on-demand mobility within a capacitated road network. We refer to such systems as autonomous mobility-on-demand
Autor:
Konstantin E. Samouylov, Viktoriya Khalina, Anna Gaidamaka, Natalia Yarkina, Natalia Popovskaya
Publikováno v:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications ISBN: 9783319680682
A thorough analysis of business processes allows a communication and digital service provider to reduce costs and to carry out digital transformation efficiently, which are important factors of the telecommunication business success. Massive numbers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac9203d10b194a28649bde1e663648db
https://doi.org/10.1007/978-3-319-68069-9_23
https://doi.org/10.1007/978-3-319-68069-9_23
Publikováno v:
IEICE Transactions on Communications. :1592-1605
Autor:
Svetlana Anulova
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319308425
We investigate a closed network consisting of two multi-servers with n customers. Service requirements of customers at a server have a common cumulative distribution function. The state of the network is described by the following state parameters: f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd829947373cdb103d8ca1586102d3fb
https://doi.org/10.1007/978-3-319-30843-2_19
https://doi.org/10.1007/978-3-319-30843-2_19
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319222660
Queueing Theory and Network Applications
Queueing Theory and Network Applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c1a0f68cf776d68419244abb1804893
https://doi.org/10.1007/978-3-319-22267-7
https://doi.org/10.1007/978-3-319-22267-7
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
James R. Morrison, Woo-sung Kim
Publikováno v:
Queueing Systems. 73:317-339
While many single station queues possess explicit forms for their equilibrium probabilities, queueing networks are more problematic. Outside of the class of product form networks (e.g., Jackson, Kelly, and BCMP networks), one must resort to bounds, s
Publikováno v:
SIGMETRICS (Abstracts)
We consider a closed queueing network model of ridesharing systems such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car flow in the network to optimize system-wide utility functions, e.g. the availa