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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal time subdivision of server among queues of customers


    Weitere Titelangaben:

    Optimale Zeitunterteilung für Server von Warteschlangen


    Beteiligte:

    Erschienen in:

    Automation and Remote Control ; 51 , 9, PT.1 ; 1219-1223


    Erscheinungsdatum :

    1990


    Format / Umfang :

    5 Seiten, 7 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    A Computational Approach to Determining the Optimal Service Policies for Two Queues Attended by a Single Server

    Zhang, Z. G. / Vickson, R. G. / Canadian Society for Mechanical Engineering | British Library Conference Proceedings | 1998



    Analysis of network of biserial queues linked with a common server

    Sharma, S. / Gupta, D. | British Library Online Contents | 2014


    Analysis of network of biserial queues linked with a common server

    Sharma, Seema / Gupta, Deepak / Sharma, Sameer | British Library Online Contents | 2014


    Real-Time Forecasts of Aircraft Departure Queues

    Shumsky, Robert A. | Online Contents | 1997