BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Queuing systems with multi-type jobs and multi-type servers - Prof
 . Gideon Weiss\, University Haifa
DTSTART:20100204T150000Z
DTEND:20100204T160000Z
UID:TALK23172@talks.cam.ac.uk
CONTACT:Neil Walton
DESCRIPTION:assignments. This is a common situation in manufacturing\, cal
 l centers with skill based routing\, matching of parent-child in adoption 
 or matching in kidney transplants etc. We consider the case of first come 
 first served policy: jobs are assigned to the first available feasible ser
 ver in order of their arrivals. We will survey some results for three diff
 erent situations: For stable system\, in which there is enough capacity to
  serve all jobs with no congestion\, we discuss a product form solution. F
 or an overloaded system with reneging\, we emphasize a global first come f
 irst served property under fluid scaling. For a balanced model we consider
  the matching of an infinite sequence of jobs and an infinite sequence of 
 servers\, and discuss its modeling by some Markov chains. This talk survey
 s work with Rene Caldentey and Ed Kaplan\, and work by Jeremy Visschers\, 
 Ivo Adan and Cor Hurkens\, and by Rishy Talreja and Ward Whitt.
LOCATION:Seminar Room 1\, Isaac Newton Institute for Mathematical Sciences
END:VEVENT
END:VCALENDAR