A problem of optimizing a sequence and durations of services conflicting queues of customers in a queueing system described by a controlled Markov chain is considered. An iterative method of dynamic programming which excludes from consideration the obviously nonoptimal controlling actions is utilized for the solution. As an example, optimal durations of stages of a traffic light controlling traffic at an isolated intersection are determined.
Optimal time subdivision of server among queues of customers
Optimale Zeitunterteilung für Server von Warteschlangen
Automation and Remote Control ; 51 , 9, PT.1 ; 1219-1223
1990
5 Seiten, 7 Quellen
Aufsatz (Zeitschrift)
Englisch
British Library Conference Proceedings | 1998
|On Optimal Ramp Control of Traffic Jam Queues
Tema Archiv | 1972
|Analysis of network of biserial queues linked with a common server
British Library Online Contents | 2014
|Analysis of network of biserial queues linked with a common server
British Library Online Contents | 2014
|Real-Time Forecasts of Aircraft Departure Queues
Online Contents | 1997
|