Showing 1 - 10 of 347
Persistent link: https://www.econbiz.de/10011644094
Persistent link: https://www.econbiz.de/10014226736
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/10009784035
Persistent link: https://www.econbiz.de/10012652820
Persistent link: https://www.econbiz.de/10012625864
Persistent link: https://www.econbiz.de/10012294358
Persistent link: https://www.econbiz.de/10011664737
Persistent link: https://www.econbiz.de/10012107782
Persistent link: https://www.econbiz.de/10011878274