Abstract
The sequence with nth term defined by left bracket (n plus 1)p right bracket - (np) is an extremal zero-one valued sequence of asymptotic mean p in the following sense (for example): if a fraction p of customers from a point process with iid interarrival times is sent to an exponential server queue according to a prespecified splitting sequence, then the long-term average queue size is minimized when the above sequence is used. The proof involves consideration of the lower convex envelope J (which is a function on R**m) of a function J on Z**m. An explicit representation is given for J in terms of J, for J in a broad class of functions, which we call 'multimodular'. The expected queue size just before an arrival, considered as a function of the zero-one splitting sequence, is shown to belong to this class.
Original language | English (US) |
---|---|
Pages (from-to) | 543-556 |
Number of pages | 14 |
Journal | Mathematics of Operations Research |
Volume | 10 |
Issue number | 4 |
DOIs | |
State | Published - 1985 |
ASJC Scopus subject areas
- General Mathematics
- Computer Science Applications
- Management Science and Operations Research