Similar Search Results

An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking

Gershwin, Stanley B. - In: Operations research 35 (1987) 2, pp. 291-305

Persistent link: https://www.econbiz.de/10001045828

Distribution function of the shortest path in networks of queues

Azaron, Amir; Modarres, Mohammad - In: OR spectrum : quantitative approaches in management 27 (2005) 1, pp. 123-144

Persistent link: https://www.econbiz.de/10002505380

Group strategyproofness in queueing models

Mitra, Manipushpak (contributor); … - 2006

Persistent link: https://www.econbiz.de/10003324697

Numerical method for the single-server bulk-service queuing system with variable service capacity, M/Gy/1, with discretized service time probability distrubution

Mejía-Téllez, Juan - In: Operations research proceedings 2005 : selected papers …, (pp. 811-816). 2006

Persistent link: https://www.econbiz.de/10003356139

When queueing is better than push and shove

Gershkov, Alex (contributor); Schweinzer, Paul (contributor) - 2006

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...