A conceptual framework for personality-sensitive scheduling models

Abstract

The paper considers the assignment problem as a model of online schedules with a deadline in a personality-sensitive setting. In this setting, processing speeds are heterogeneous and depend not only on a type of request but also on individual characteristics of groups of customers and operators. We propose a formal statement of the optimization problem and discuss its applicability for real-world scenarios using the example of a call center request processing system.