| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143074 | Operations Research Letters | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P. Moyal,