Skill based parallel servers under FCFS-ALIS and infinite bipartite matching

Add to your list(s) Download to your calendar using vCal

• Gideon Weiss (University of Haifa)
• Wednesday 21 January 2015, 14:00-15:00
• MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Felix Fischer.

note unusual time and place

We consider skill based parallel server systems under policy of first come first served and assign to longest idle server. Key quantities for this model are matching rates – what fraction of customers of type i are served by server type j. Stability and performance are highly dependent on these matching rates and much is still unknown. We discuss some relevant topics: product form solution and  fluid scaling, reversibility of FCFS infinite bipartite matching model, heuristics for service systems design, and many server scaling.   Joint work with Ivo Adan, Marko Boon, Jean Mairesse, Ana Busic and Hanqin Zhang.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.