Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks
We consider the problem of optimizing a polling system, i.e., of optimally sequencing a server in a multi-class queueing system with switch-over times in order to minimize a linear objective function of the waiting times. The problem has important applications in computer, communication, production...
Main Authors: | Bertsimas, Dimitris J., Xu, Haiping |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5356 |
Similar Items
-
Optimal policies for stochastic and dynamic vehicle routing problems
by: Xu, Haiping
Published: (2005) -
Stochastic Dynamic Vehicle Routing in the Euclidean Plane: The Multiple-Server, Capacitated Vehicle Case
by: Bertsimas, Dimitris J., et al.
Published: (2004) -
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
by: Bertsimas, Dimitris, et al.
Published: (2021) -
Enhancing the modeling capabilities of polling systems via customer routing
by: , MOSSA, Bahru, et al.
Published: (1997) -
Probabilistic combinatorial optimization problems
by: Bertsimas, Dimitris
Published: (2005)