Key points are not available for this paper at this time.
We consider a memoryless single station service system with servers S=m₁,. . . , mK, and with job types C=a, b,. . . . Service is skill-based, so that server mᵢ can serve a subset of job types C (mᵢ). Waiting jobs are served on a first-come-first-served basis, while arriving jobs that find several idle servers are assigned to a feasible server randomly. We show that there exist assignment probabilities under which the system has a product-form stationary distribution, and obtain explicit expressions for it. We also derive waiting time distributions in steady state.: Service system – First-come-first-served policy – Multi-type jobs – Multi-type servers – Partial balance – Product form solution
Bregman et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: