Dynamic scheduling in single-server multiclass service systems with unit buffers

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199106)38:3<383::AID-NAV3220380308>3.0.CO;2-D" /><383::AID-NAV3220380308>3.0.CO;2-D 10.1002/1520-6750(199106)38:3<383::AID-NAV3220380308>3.0.CO;2-DzbMath0725.90033OpenAlexW2071287352MaRDI QIDQ5202814

Sid Browne, Uri Yechiali

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199106)38:3<383::aid-nav3220380308>3.0.co;2-d

zbMATH Keywords

SimulationsIndex policiesoptimal dynamic sequencingsingle-server multiclass service system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Mathematical methods to study the polling systems ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ On optimal polling policies

Cites Work

• Unnamed Item

This page was built for publication: Dynamic scheduling in single-server multiclass service systems with unit buffers