Analysis of a Finite-Source Customer Assignment Model with no State Information

Mathematical Methods of Operations Research

Volumn 47, Issue 2, 1998, Pages 317-336

  Hordijk, Arie ^a   Loeve, Anneke ^a   Tiggelman, Jeroen ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b Consul Risk Management BV ^*  (Netherlands)

Author keywords

Algorithm; Closed queueing network; Static customer routing

Indexed keywords

EID: 0002030922     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01194403     Document Type: Article

References (7)

1. Dijk NM van (1993). Queueing networks and product forms: A systems approach, Wiley, New York
2. Hordijk A (1983) Insensitivity for stochastic networks. Mathematical Computer Performance and Reliability: 77-94 North-Holland, Amsterdam
3. Hordijk A, Koole G, Loeve JA (1994) Analysis of a customer assignment model with no state information. Probability in the Engineering and Informational Sciences 8:419-429
4. Hordijk A, Loeve JA (1994) Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy. ZOR-Mathematical Methods of Operations Research 40:163-181
5. Hordijk A, Loeve JA (1996) Optimal static customer routing in a closed queueing network. RUL Report TW96-12
6. Kelly FP (1979) Reversibility and stochastic networks. Wiley, New York
7. Serfozo RF (1989) Markovian network processes: Congestion dependent routing and processing. Queueing Systems 5:5-36