Optimal allocation of a server between two queues with due times

Abstract

Two queues share a single server. Arrivals to each queue have individual target due times for service completion (their due times are known to the controller) and a penalty is incurred when they stay in the system after the expiration of these due times. The two classes have different service requirements and incur penalty at different rates. The problem of dynamic priority assignment so as to minimize the discounted and average tardiness per customer is considered. The problem is formulated in discrete time where it is shown that, under the assumptions of geometric arrivals and geometric services, there is a nonidling stationary optimal preemptive policy. Within each class, the policy chooses, if at all, the customer with the smallest due time. A partial order on the space of the set of residual times is introduced. It is shown that the optimal choice of the customer class is monotonic with respect to this partial order; this implies a switchover-type property in the appropriate space. A combination of stochastic dominance and dynamic programming ideas is used to establish the results.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 16 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.