Convex comparison of service disciplines in real time queues
Probability
2008-01-08 v2
Abstract
We present a comparison of the service disciplines in real-time queueing systems (the customers have a deadline before which they should enter the service booth). We state that giving priority to customers having an early deadline minimizes the average stationary lateness. We show this result by comparing adequate random vectors with the Schur-Convex majorization ordering.
Keywords
Cite
@article{arxiv.0704.2885,
title = {Convex comparison of service disciplines in real time queues},
author = {Pascal Moyal},
journal= {arXiv preprint arXiv:0704.2885},
year = {2008}
}