In this paper the authors consider the allocation of agents circulating in a bipartite closed network to maximize system throughput. The particular network model, defined by the authors, is a parallel-cycle network with m central nodes and n parallel nodes.
Recensione dell'articolo:(Brooks, James D.; Kar, Koushik; Mendonça, David - "Allocation of flows in closed bipartite queueing networks." - European J. Oper. Res. 255 (2016), no. 2, 333-344.) MR3518805 MathSciNet ISSN 2167-5163
Leonardo Pasini
2017-01-01
Abstract
In this paper the authors consider the allocation of agents circulating in a bipartite closed network to maximize system throughput. The particular network model, defined by the authors, is a parallel-cycle network with m central nodes and n parallel nodes.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
