ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE

DOI10.15807/jorsj.23.341zbMath0448.60065OpenAlexW399627660MaRDI QIDQ3894746

J. George Shanthikumar

Publication date: 1980

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.23.341

zbMATH Keywords

regenerative processescontrol of queuesoptimal control policiesproperties of level crossings

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (6)

Optimal design and control of queues ⋮ Queueing systems with vacations - a survey ⋮ A priority M/G/1 queue with application to voice/data communication ⋮ On reducing time spent in M/G/1 systems ⋮ Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue ⋮ Control of the service process in a queueing system

This page was built for publication: ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE