Loading...

Finding an optimal core on a tree network with M/G/c/c state-dependent queues

Moshtagh, M ; Sharif University of Technology | 2019

275 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00186-018-0651-3
  3. Publisher: Springer Verlag , 2019
  4. Abstract:
  5. We consider the stochastic queue core problem on a tree network. Our aim is to find an optimal path on a tree network subject to the average travel time of particles moving along the tree for service given by a server traversing along the optimal path. We assume that particles originating at a node on a tree network request their demands for service randomly and the server is modeled first by an M/M/1 and then by an M/G/1 queue using the FIFO discipline. We consider that all paths along which the particles travel are modeled with an M/G/c/c state-dependent queue with the particles being independent of each other having demands according to the Poisson distribution. Two algorithms are developed for computing the optimal path on a tree network along with the M/M/1 and the M/G/1 queues. The computational complexity of the algorithms and illustrative numerical results obtained by implementations of the algorithms in MATLAB software environment are given. © 2018, Springer-Verlag GmbH Germany, part of Springer Nature
  6. Keywords:
  7. Core of a tree network ; Facility location ; M/G/c/c state-dependent queue ; Queueing theory ; Stochastic queue core ; Computational complexity ; Forestry ; MATLAB ; Poisson distribution ; Stochastic systems ; Travel time ; Average travel time ; Core problems ; Facility locations ; Matlab- software ; Numerical results ; State-dependent queues ; Stochastic queues ; Tree network
  8. Source: Mathematical Methods of Operations Research ; Volume 89, Issue 1 , 2019 , Pages 115-142 ; 14322994 (ISSN)
  9. URL: https://link.springer.com/article/10.1007/s00186-018-0651-3