Optimal scheduling policies in time sharing service systems

DOI10.1016/0895-7177(95)00202-DzbMath0844.60074OpenAlexW1973130385MaRDI QIDQ1905882

Yanyan Li

Publication date: 14 August 1996

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(95)00202-d

zbMATH Keywords

average costoptimal scheduling policiesKlimov's indicestime sharing service systems

Mathematics Subject Classification ID

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

Related Items (1)

On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NBUC and NWUC classes of life distributions
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• On extremal service disciplines in single-stage queueing systems
• Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
• An extremal property of FIFO discipline in G/IFR/1 queues
• An extremal property of the fifo discipline via an ordinal version of
• Time-Sharing Service Systems. II
• Time-Sharing Service Systems. I
• Further results for dynamic scheduling of multiclass G/G/1 queues
• Time Sharing with Priorities
• Work-conserving priorities
• A conservation law for single-server queues and its applications

This page was built for publication: Optimal scheduling policies in time sharing service systems