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

DOI10.2307/3214416MaRDI QIDQ4733650zbMATH OpenOpenAlexFDO

Authors Tetsuji Hirayama, Masaaki Kijima, Shoichi Nishimura

Publication date 1989

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3214416

zbMATH Keywords

preemptive resumenon-preemptive servicediscrete-time dynamic schedulinginterchange argument

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
• Dynamic scheduling in single-server multiclass service systems with unit buffers
• Dynamic scheduling of a two-class queue with setups
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

Cited in

(8)

• Beyond the c rule: Dynamic scheduling of a two-class loss queue
• Dynamic scheduling in single-server multiclass service systems with unit buffers
• Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
• Optimal scheduling of parallel queues using stochastic flow models
• A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
• On the Gittins index for multistage jobs
• Optimal scheduling policies in time sharing service systems
• Scheduling of Multi-Class Single-Server Queues Under Nontraditional Performance Measures

This page was built for publication: Further results for dynamic scheduling of multiclass G/G/1 queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733650)