Near optimal control of queueing networks over a finite horizon

Y. Nazarathy, G. Weiss

    Research output: Contribution to journalArticleAcademicpeer-review

    23 Citations (Scopus)

    Abstract

    We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a policy by which the queueing network tracks the fluid solution. To that end we model the deviations between the queuing and the fluid network in each of the intervals by a multi-class queueing network with some infinite virtual queues. We then keep these deviations stable by an adaptation of a maximum pressure policy. We show that this method is asymptotically optimal when the number of items that is processed and the processing speed increase. We illustrate these results through a simple example of a three stage re-entrant line.
    Original languageEnglish
    Pages (from-to)233-249
    JournalAnnals of Operations Research
    Volume170
    Issue number1
    DOIs
    Publication statusPublished - 2008

    Fingerprint

    Dive into the research topics of 'Near optimal control of queueing networks over a finite horizon'. Together they form a unique fingerprint.

    Cite this