Jeremy Visschers

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider a memoryless single station service system with servers S = {m1, . . . , mK}, and with job types C = {a, b, . . .}. Service is skill based, so that server mi can serve a subset of job types C(mi). Waiting jobs are served on a first come first served basis, while arriving jobs that find several idle servers are assigned to a feasible server(More)
In this paper we present a class of queueing models with multiple job types, multiple machines and machine dependent processing times. Each machine is restricted in such a way that it can only handle jobs from a specific, machine dependent, set of job types. If a job arrives at the system and it can be handled by two or more idle machines, then a(More)
  • 1