Optimal service assignment in a finite-source queue

DOI10.1109/9.8650zbMath0672.90053OpenAlexW2040984001MaRDI QIDQ3826340

Tetsuji Hirayama

Publication date: 1989

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.8650

zbMATH Keywords

dynamic schedulingindex policyinfinite planning horizonexpected present value of rewardsfinite-source M/M/1 systempreemptive service assignment policyseveral types of customers

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)

This page was built for publication: Optimal service assignment in a finite-source queue