Convex comparison of service disciplines in real time queues

Simple item page
dc.creatorMoyal, Pascal
dc.date2007-04-22
dc.date2008-01-08
dc.date.accessioned2026-07-07T08:52:42Z
dc.date.available2026-07-07T08:52:42Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0704.2885
dc.identifierhttp://arxiv.org/abs/0704.2885
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145366
dc.subjectProbability
dc.titleConvex comparison of service disciplines in real time queues
dc.typetext

Files

Collections

arXiv