Serving process with least thinking time maximizes resource utilization

DOI10.1109/TAC.1984.1103432zbMath0549.90046OpenAlexW2109597991MaRDI QIDQ3342191

Costas Courcoubetit, Pravin P. Varaiya

Publication date: 1984

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

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

zbMATH Keywords

Markov chaincommon resourceleast thinking timemaximal resource utilizationpreemptive scheme

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

On stochastic optimality of policies in first passage problems ⋮ On the optimal maintenance of systems and control of arrivals in queues ⋮ Optimal server scheduling in nonpreemptive finite-population queueing systems

This page was built for publication: Serving process with least thinking time maximizes resource utilization