8 citations · 18 across the 9 of their papers we have counts for
7 papers · 1 filter
Directed FCFS Infinite Bipartite Matching
Gideon Weiss
We consider an infinite sequence consisting of agents of several types and goods of several types, with a bipartite compatibility graph between agent and good types. Goods are matc…
FCFS Parallel Service Systems and Matching Models
Ivo Adan, Igor Kleiner, Rhonda Righter +1
We consider three parallel service models in which customers of several types are served by several types of servers subject to a bipartite compatibility graph, and the service pol…
Fluid Models of Parallel Service Systems under FCFS
Yuval Nov, Gideon Weiss, Hanqin Zhang
We study deterministic fluid approximations of parallel service systems operating under first come first served policy (FCFS). The condition for complete resource pooling is identi…
Many Server Scaling of the N-System Under FCFS-ALIS
Dongyuan Zhan, Gideon Weiss
The N-System with independent Poisson arrivals and exponential server-dependent service times under first come first served and assign to longest idle server policy has explicit st…
Design Heuristic for Parallel Many Server Systems under FCFS-ALIS
Ivo Adan, Marko Boon, Gideon Weiss
We study a parallel queueing system with multiple types of servers and customers. A bipartite graph describes which pairs of customer-server types are compatible. We consider the s…
Local stability in a transient Markov chain
Ivo Adan, Sergey Foss, Seva Shneer +1
We prove two propositions with conditions that a system, which is described by a transient Markov chain, will display local stability. Examples of such systems include partly overl…