Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
From MaRDI portal
Publication:1197750
DOI10.1007/BF02023090zbMath0760.90041OpenAlexW2092752818MaRDI QIDQ1197750
Publication date: 16 January 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023090
Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (16)
On the Control of a Queueing System with Aging State Information ⋮ An effective numerical method for controlled routing in large trunk line networks ⋮ Workload minimization in re-entrant lines ⋮ A numerical method for reflected diffusions: Control of the reflection directions and applications ⋮ Waiting time based routing policies to parallel queues with percentiles objectives ⋮ Approximate receding horizon approach for Markov decision processes: average reward case ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system ⋮ Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station ⋮ On the scheduling of operations in a chat contact center ⋮ Exponential penalty function control of loss networks ⋮ On the optimal control of a two-queue polling model ⋮ DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS ⋮ On the structure of value functions for threshold policies in queueing models ⋮ Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement ⋮ On the value function of the M/Cox(r)/1 queue ⋮ Dispatching fire trucks under stochastic driving times
Cites Work
This page was built for publication: Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
