{'fraction_non_alphanumeric': 0.016709511568123392, 'fraction_numerical': 0.0, 'mean_word_length': 5.232, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Real-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers

Motivated by call centers applications, we consider a queueing system with two classes of customers, important and low important ones. We allow customers to be impatient, that is one customer may leave the system before beginning service. We focus on scheduling policies that assign customers, upon arrival, to parallel queues, high and low priority queues. The policies are developed subject to satisfying constraints on performances related to the fraction of customers served, the mean and the variance of the waiting time in queue. We analyze several dynamic scheduling policies in order to meet our objective. These policies are characterized to be simple and easy to implement in practice