The µc-rule is not optimal in the second node of the tandem queue: a counterexample

DOI10.2307/1427742zbMath0749.90043OpenAlexW2018441056WikidataQ124967378 ScholiaQ124967378MaRDI QIDQ3991661

Ger Koole, Arie Hordijk

Publication date: 28 June 1992

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

counterexampletandem queuestochastic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic systems in control theory (general) (93E03)

Related Items (2)

Sample path methods in the control of queues ⋮ On the Assignment of Customers to Parallel Queues

This page was built for publication: The µc-rule is not optimal in the second node of the tandem queue: a counterexample