Further results for dynamic scheduling of multiclassG/G/1 queues

Abstract

We consider discrete-time dynamic scheduling problems of the following three types ofG/G/1 queue withKdifferent customer classes: (i) aG/DFR/1 queue withKclasses under preemptive resume service discipline, (ii) aG/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) aG/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for aG/M/1 queue by Buyukkoc et al. (1985) to general queues.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 27 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.