Regular ordering and applications in control policies (Q1610354): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regular ordering and applications in control policies |
scientific article |
Statements
Regular ordering and applications in control policies (English)
0 references
19 August 2002
0 references
This paper deals with the problem of routing customers in several queues in parallel using a softer approach. The authors did not try to compute the optimal policy, which seems to be a very hard task. Instead, they introduced the notion of regular ordering for periodic sequences based on the gaps between the entries and defined the notion of regular preserving functions using Schur convexity. This is used to extend some optimization results in queueing control problems. In particular, they showed that the maximal traveling time in a stochastic event graph as well as the transmission times in a channel with redundancy, decrease (in the stochastic sense) when the input sequence becomes more regular.
0 references
Schur convexity
0 references
regular ordering balanced sequences
0 references
admission control
0 references
(max, plus) algebra
0 references