A dynamic routing problem - numerical procedures for light traffic conditions
Consider a queueing system which consists of N parallel single-server channels. Customers arrive in a Poisson stream, and service times are exponentially distributed. Each channel has a finite capacity, and no jockeying is allowed. A waiting cost \(c_ i\) per unit time is incurred in the ith channel. We seek a policy for assigning arriving customers to channels as a function of the queue length which minimizes the total expected discounted cost. For light traffic intensity, asymptotic techniques are used to derive the explicit form of this policy.
- On the Assignment of Customers to Parallel Queues
- scientific article; zbMATH DE number 4059093
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
- Minimizing response times and queue lengths in systems of parallel queues
- Optimal control in light traffic Markov decision processes
- Load balancing in a multiserver queueing system
- Dynamic Routing in a Queueing System with a Multiple Service Facility
- scientific article; zbMATH DE number 519987 (Why is no real title available?)
- Dynamic routing and jockeying controls in a two-station queueing system
- Workload minimization in re-entrant lines
This page was built for publication: A dynamic routing problem - numerical procedures for light traffic conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069436)
