{'fraction_non_alphanumeric': 0.010526315789473684, 'fraction_numerical': 0.0, 'mean_word_length': 5.224299065420561, '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}}
Optimal scheduling problem for Taiwan's post office counters and manpower

In this study, we develop several models that combine with queuing theory in order to help a post office to solve the optimization of staff numbers at services counters comply with practical demands. The models are formulated using linear programming. A numerical example is presented to illustrate the models and the solution method using real data from a post office in eastern Taiwan. Analytical results indicate that the proposed models are efficient in improving service efficiency and customer satisfaction, and can be a reference for practical manpower allocation in the post office.