An approximation model for sojourn time distributions in acyclic multi-server queueing networks

摘要

We develop an approximation model for the sojourn time distribution of customers or jobs arriving to an acyclic multi-server queueing network. The model accepts general interarrival times and general service times, and is based on the characteristics of phase-type distributions. The model produces excellent results for multi-server networks with a small to medium number of workstations, but is less accurate when the number of workstations is large. (C) 2015 Published by Elsevier Ltd.