University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Skill based parallel servers under FCFS-ALIS and infinite bipartite matching

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

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity