Conditions for efficient batch job processing of customers in priority-driven computing systems where the queueing time is constrained

For an $M_n/G_n/1$ batch job customer processing system functions are obtained of the queueing time as are its mean and variance. An engineering approach is proposed to determining the necessary conditions for efficient application of the batch job processing discipline as a possible way to control the computing process in priority-driven system where the user imposes constraints on the queueing time. The applicability of the findings to improving the efficiency of computing systems is illustrated with an example.