Title: Design for parallel skill based service systems.
Service systems with several types of customers and servers subject to a bipartite compatibility graph are in general quite intractable. I will discuss tractable examples of such systems, and their relation to the simpler tractable model of FCFS bipartite matching, and present a conjecture, and a heuristic based on it, to answer problems of design for large scale general systems
Gideon Weiss is professor emeritus at the Department of Statistics in the University of Haifa, Israel. He has previously been on the faculty of ISYE GA Tech 1983--1994. His research interests are scheduling and control of queueing networks (recent book, Cambridge University Press), and simplex methods for continuous linear programming.