Motivated by a practical situation for the production/assembly of Printed Circuit Boards, we study a generalized shortest queue system. This system consists of parallel servers, which all have their own queue. The system serves several types of jobs, which arrive according to Poisson processes. Because of technical reasons, most or all types of arriving jobs can only be served by a restricted set of servers. All jobs have the same exponential service time distribution, and, in order to minimize its own service time, each arriving job joins (one of) the shortest queue(s) of all queue(s) where the job can be served. The behavior of the resulting queueing system may be described by a multi-dimensional Markov process. Since an analytical solution for this Markov process is hard to obtain, we present flexible bound models in order to find the most relevant performance measures, viz. the waiting times for each of the job types separately and for all job types together. The effectiveness of the flexible bound models is shown by some numerical results.
|Title of host publication||Ten Years LNMB, CWI Tract 122|
|Editors||W.K. Klein Haneveld, O.J. Vrieze, L.C.M. Kallenberg|
|Place of Publication||Amsterdam|
|Publisher||Stichting Mathematisch Centrum|
|Publication status||Published - 1997|