OPTIMAL PRIORITY ASSIGNMENT WITH HETEROGENEOUS WAITING COSTS.

Avraham Beja, Esther Sid

Research output: Contribution to journalArticlepeer-review

Abstract

For an M/G/1 queueing system, this paper assumes tha the discipline is administratively constrained to a 'head-of-the-line' rule with n classes, and that priorities are centrally assigned to customers according to their individual cost per unit time spent in the system, or their individual service-time requirements, or both (as the available information may be), but independently of the state of the queue. Then optimal priority-assignment rules for the various information structures are characterized.

Original languageEnglish
Pages (from-to)107-117
Number of pages11
JournalOperations Research
Volume23
Issue number1
DOIs
StatePublished - 1975

Fingerprint

Dive into the research topics of 'OPTIMAL PRIORITY ASSIGNMENT WITH HETEROGENEOUS WAITING COSTS.'. Together they form a unique fingerprint.

Cite this