{'fraction_non_alphanumeric': 0.021335807050092765, 'fraction_numerical': 0.0, 'mean_word_length': 5.130681818181818, '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 batch process admission control in tandem queueing systems with queue time constraint considerations

In this paper, a dynamic control method for two-stage queueing systems with process queue time (PQT) constraints is presented. This queueing system consists of an upstream batch process machine and a downstream single process machine. The waiting time of each job in the downstream queue is constrained by an upper limit. Violation of this upper limit causes scrap of the job. A batch machine poses a problem for the two-stage system under PQT constraints. After completion of batch process, a large quantity of work-in-process (WIP) moves into the downstream queue with PQT constraints. This increases the variance of downstream queue length and the probability of scrap. In this research, we incorporate dynamic programming algorithm in batch process admission control (BPAC) model. The performance of BPAC model is verified by simulation. Simulation results demonstrate that the proposed BPAC model outperforms other methods in every key system performance indices.