Serving process with least thinking time maximizes resource utilization

DOI10.1109/TAC.1984.1103432MaRDI QIDQ3342191zbMATH OpenOpenAlexFDO

Authors Costas Courcoubetit, Pravin 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

common resourceleast thinking timeMarkov chainmaximal resource utilizationpreemptive scheme

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3970497
• The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes
• On waiting for simultaneous access to two resources: Deterministic service distribution
• scientific article; zbMATH DE number 622473
• Optimal scheduling policies in time sharing service systems

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342191)