System capacity optimization design and optimal control policy (N^* ,D^*) for M/G/1 queue with p-entering discipline and Min(N,D,V)-policy

MaRDI QIDQ3306153zbMATH OpenFDO

Authors Le Luo, Yinghui Tang

Publication date 12 August 2020

zbMATH Keywords

queue length distributionmultiple vacationoptimal control policy\(p\)-entering discipline

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• M/G/1 queueing system with Min\( (N, V)\)-policy based on \(p\)-entering discipline and single vacation
• scientific article; zbMATH DE number 7267268
• M/G/1 queueing system with \({\mathrm{Min}} (N,D,V)\)-policy control
• System capacity optimization design and optimal control threshold \({N^*}\) for \(M/G/1\) queueing system with delayed vacation and \({\mathrm{Min}} (N,V)\)-policy
• M/G/1 queueing system with multiple adaptive vacations and min\( (N,V)\)-policy

Cited in

(4)

• M/G/1 queueing system with Min\( (N, V)\)-policy based on \(p\)-entering discipline and single vacation
• Analysis of \(M/G/1\) queueing system for single server vacation without interruption under the control of \(D\)-policy
• Performance analysis of an \(M/G/1\) queue with bi-level randomized \((p, N_1, N_2)\)-policy
• Analysis of \(M/G/1\) queue with bi-level threshold \((m,N)\)-policy and uninterrupted single vacation

This page was built for publication: System capacity optimization design and optimal control policy \((N^* ,D^*)\) for \(\mathrm{M}/\mathrm{G}/1\) queue with \(p\)-entering discipline and \(\mathrm{Min}(N,D,V)\)-policy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306153)