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 - Weis
 s\, G (Haifa)
DTSTART:20100204T150000Z
DTEND:20100204T160000Z
UID:TALK23094@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We consider a system where jobs of several types are served by
  servers of several types\, and a bipartite graph between server types and
  job types describes feasible assignments.\n\nThis is a common situation i
 n manufacturing\, call centers with skill based routing\, matching of pare
 nt-child in adoption or matching in kidney transplants etc.\n\nWe consider
  the case of first come first served policy: jobs are assigned to the firs
 t available feasible server in order of their arrivals.  We will survey so
 me results for three different situations:\nFor stable system\, in which t
 here is enough capacity to serve all jobs with no congestion\, we discuss 
 a product form solution.\n\nFor an overloaded system with reneging\, we em
 phasize a global first come first served property under fluid scaling.\n\n
 For a balanced model we consider the matching of an infinite sequence of j
 obs and an infinite sequence of servers\, and discuss its modeling by  som
 e Markov chains.\n\nThis talk surveys work with Rene Caldentey and Ed Kapl
 an\, and work by Jeremy Visschers\, Ivo Adan and Cor Hurkens\, and by Rish
 y Talreja and Ward Whitt.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR