{'fraction_non_alphanumeric': 0.014285714285714285, 'fraction_numerical': 0.002380952380952381, 'mean_word_length': 5.101449275362318, '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}}
A Practical Optimization Techniques for M X/D/1 Queuing Model

In the present paper the problem of minimizing total queuing time for single server queuing system with batch arrival has been considered. The customers arrive for service in batches of different sizes. For different categories of customers the arrival pattern follows the Poisson distribution. The service time distribution is based on deterministic model.