Showing 1 - 10 of 102
Persistent link: https://www.econbiz.de/10011957587
The thesis provides an algorithmic approach to the scheduling problem for call centre agents. It shows that this problem is NP-complete and even inapproximable. A broad statistical analysis of call data from a call centre is contained, too.
Persistent link: https://www.econbiz.de/10009632961
Persistent link: https://www.econbiz.de/10013360889
Persistent link: https://www.econbiz.de/10012405479
Persistent link: https://www.econbiz.de/10011441447
Persistent link: https://www.econbiz.de/10011546766
Persistent link: https://www.econbiz.de/10011504476
Persistent link: https://www.econbiz.de/10012098053