Analysis of a finite-source customer assignment model with no state information

DOI10.1007/BF01194403zbMath0927.90018MaRDI QIDQ1298752

Anneke Loeve, Jeroen Tiggelman, Arie Hordijk

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

closed queueing networkparallel queuesexponential service timesaverage optimal policy

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

Improving routing decisions in parallel non-observable queues

Cites Work

• Markovian network processes: Congestion-dependent routing and processing
• Optimal static customer routing in a closed queuing network
• Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy
• Unnamed Item

This page was built for publication: Analysis of a finite-source customer assignment model with no state information