Convex comparison of service disciplines in real time queues

Authors:
P. Moyal
Affiliations:
Laboratoire de Mathématiques Appliquées - Université de Technologie de Compiègne, Centre de Recherches de Royallieu, BP 20 529, 60 205 Compiegne Cedex, France
Venue:
Operations Research Letters
Year:
2008

Citing 3
Cited 1

Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

Journal of the ACM (JACM)
An optimal lateness and tardiness scheduling in real-time systems

Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

On queues with impatience: stability, and the optimality of Earliest Deadline First

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.