Abstract

The system is modeled as a single-server queueing system having a finite number of each of two types of worker: document user and document entry operator. Worker think times are assumed to be exponentially distributed while job service times are drawn from general distributions; worker think times and job service times are dependent upon worker type. Throughput and waiting times as a function of the number of users of each type are analyzed under a nonpreemptive rule in which document use has priority over document entry.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call