Numerical Procedure for the Selection of the Constant Interarrival Time to a Single Server Queue

摘要

A single server queue with determinate arrivals is studied to find the optimal interarrival time. No analytically tractable solution is available except in one particular case, but under the assumption of a phase type service time distribution, the model has a tractable algorithmic solution. The algorithm is presented and its implementation is demonstrated through interactive computation. The algorithm is shown to provide sufficient information about the system to be useful in a variety of problems in engineering design.