A LOSS SYSTEM WITH SKILL-BASED SERVERS UNDER ASSIGN TO LONGEST IDLE SERVER POLICY

DOI10.1017/S0269964812000034zbMath1277.60149OpenAlexW2139420357MaRDI QIDQ4911117

Gideon Weiss, Ivo J. B. F. Adan

Publication date: 13 March 2013

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964812000034

zbMATH Keywords

performance measuressteady-state distributionPoisson inputsmulticlass customersmultiserver loss systemlongest idle server assignment

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (9)

ON THE ADAN–WEISS LOSS MODEL HAVING SKILL-BASED SERVERS AND LONGEST IDLE ASSIGNMENT RULE ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ A survey on skill-based routing with applications to service operations management ⋮ On the rate of convergence for infinite server Erlang-Sevastyanov's problem ⋮ Minimizing expected discounted cost in a queueing loss model with discriminating arrivals ⋮ Pass-and-swap queues ⋮ Reversibility and Further Properties of FCFS Infinite Bipartite Matching ⋮ A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments

Cites Work

• A product form solution to a system with multi-type jobs and multi-type servers
• A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
• Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
• Fcfs infinite bipartite matching of servers and customers

This page was built for publication: A LOSS SYSTEM WITH SKILL-BASED SERVERS UNDER ASSIGN TO LONGEST IDLE SERVER POLICY