BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Queues with skill based routing under FCFS - ALIS (Assign Longest 
 Idle Server) regime - Gideon Weiss\, The University of Haifa
DTSTART:20101025T133000Z
DTEND:20101025T143000Z
UID:TALK27015@talks.cam.ac.uk
CONTACT:Neil Walton
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. This is a common situation in m
 anufacturing\, call 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 av
 ailable feasible server in order of their arrivals.  We consider two types
  of policies for assigning customers to idle servers - a random assignment
  and assignment to the longest idle server (ALIS)\nWe survey some results 
 for four different situations:\n- For a loss system we find conditions for
  reversibility and insensitivity.\n- For a manufacturing type system\, in 
 which there is enough capacity to serve all jobs\, we discuss a product fo
 rm solution and waiting times.\n- For an infinite matching model in which 
 an infinite sequence of customers of i.i.d. types\, and infinite sequence 
 of servers of i.i.d. types are matched according to first come first\, we 
 obtain a product form stationary distribution for this system\, which we u
 se to calculate matching rates.\n- For a call center model with overload a
 nd abandonments we make some plausible observations\n\nThis talk surveys j
 oint work with Ivo Adan\, Rene Caldentey\, Cor Hurkens\, Ed Kaplan and Dam
 on Wischik\, as well as work by Jeremy Visschers\, Rishy Talreja and Ward 
 Whitt. 
LOCATION:MR12\,  Centre for Mathematical Sciences\, Wilberforce Road\, Cam
 bridge
END:VEVENT
END:VCALENDAR