Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
From MaRDI portal
Publication:3415933
DOI10.1017/S0269964800001194zbMath1134.90413MaRDI QIDQ3415933
J. George Shanthikumar, Rhonda Righter
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (24)
SEH: size estimate hedging for single-server queues ⋮ Handling load with less stress ⋮ \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL ⋮ Optimal scheduling policies in time sharing service systems ⋮ SCHEDULING IN A SINGLE-SERVER QUEUE WITH STATE-DEPENDENT SERVICE RATES ⋮ Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities ⋮ Optimal myopic policies and index policies for stochastic scheduling problems ⋮ Monotonicity properties for multi-class queueing systems ⋮ Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ Design of manufacturing systems using queueing models ⋮ \(M/G/1/MLPS\) compared to \(M/G/1/PS\) ⋮ Asymptotically optimal parallel resource assignment with interference ⋮ A survey on discriminatory processor sharing ⋮ On the Gittins index in the M/G/1 queue ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ Optimal server assignment in the case of service times with monotone failure rates ⋮ Monotonicity in the Limited Processor-Sharing Queue ⋮ PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING ⋮ On the nonoptimality of the foreground-background discipline for IMRL service times ⋮ On stochastic machine scheduling with general distributional assumptions ⋮ Batch arrival processor-sharing with application to multi-level processor-sharing scheduling ⋮ Partial Flexibility in Routeing and Scheduling ⋮ Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
Cites Work
This page was built for publication: Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
