Showing 1 - 10 of 28
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...
Persistent link: https://www.econbiz.de/10011346493
Persistent link: https://www.econbiz.de/10002983062
In this companion paper of [10] we introduce the combinatorial notion of unbalance for a routing pattern. Using this unbalance we derive an upper bound for the total average expected waiting time of jobs which are routed to parallel queues according to a periodic routing rule. A billiard...
Persistent link: https://www.econbiz.de/10010999582
In this companion paper of [10] we introduce the combinatorial notion of unbalance for a routing pattern. Using this unbalance we derive an upper bound for the total average expected waiting time of jobs which are routed to parallel queues according to a periodic routing rule. A billiard...
Persistent link: https://www.econbiz.de/10010847538
In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the...
Persistent link: https://www.econbiz.de/10010950328
Persistent link: https://www.econbiz.de/10006611071
In this paper, we consider deterministic (both fluid and discrete) polling systems with <I>N</I> queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...</i>
Persistent link: https://www.econbiz.de/10005137254
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...
Persistent link: https://www.econbiz.de/10011257131
Persistent link: https://www.econbiz.de/10003974003
In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...
Persistent link: https://www.econbiz.de/10011380145