Elementary queueing theory based on possibility theory

The paper considers a queueing system with multiple parallel servers, finite or infinite system capacity and calling source, but whose arrivals and service completions are governed by a possibility distribution. Changes in the number of customers in the system is modeled by a transition matrix ¦[ and powers of ¦[, under max-min product, produce (if it converges) the steady-state possibility distribution. Results are applied to the machine servicing problem to determine the most economical size of the repair crew.