Contrôle dynamique de flux dans un système d'attente avec panne

A. Haqiq; N. Mikou

RAIRO - Operations Research (2010)

  • Volume: 33, Issue: 1, page 69-86
  • ISSN: 0399-0559

Abstract

top
We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.

How to cite

top

Haqiq, A., and Mikou, N.. "Contrôle dynamique de flux dans un système d'attente avec panne ." RAIRO - Operations Research 33.1 (2010): 69-86. <http://eudml.org/doc/197831>.

@article{Haqiq2010,
abstract = { We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths. },
author = {Haqiq, A., Mikou, N.},
journal = {RAIRO - Operations Research},
keywords = {Queuing System; Dynamic Programming; Markov Decision Processes; Optimal Policy. ; queueing system; Markov decision processes; dynamic programming; threshold optimal policy},
language = {eng},
month = {3},
number = {1},
pages = {69-86},
publisher = {EDP Sciences},
title = {Contrôle dynamique de flux dans un système d'attente avec panne },
url = {http://eudml.org/doc/197831},
volume = {33},
year = {2010},
}

TY - JOUR
AU - Haqiq, A.
AU - Mikou, N.
TI - Contrôle dynamique de flux dans un système d'attente avec panne
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 1
SP - 69
EP - 86
AB - We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.
LA - eng
KW - Queuing System; Dynamic Programming; Markov Decision Processes; Optimal Policy. ; queueing system; Markov decision processes; dynamic programming; threshold optimal policy
UR - http://eudml.org/doc/197831
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.