A method for solving stationary equations for priority time-sharing service process in random environment

DOI10.1007/978-3-030-72247-0_23zbMath1470.60267OpenAlexW3152416307MaRDI QIDQ1980538

Andrei V. Zorine, Kseniya O. Sizova

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72247-0_23

zbMATH Keywords

stationary probability distributionnon-ordinary input flowsrandom external environmentstationary probability computation algorithmsymbolic manipulation program applicationtime-sharing queueing system with readjustment times

Mathematics Subject Classification ID

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

Uses Software

• DCUHRE
• Maxima
• QUADPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of control of conflict flows with repeated service
• Computing the zeros of analytic functions
• Optimization of control of doubly stochastic nonordinary flows in time-sharing systems
• Time-Sharing Service Systems. I
• Algorithm 698: DCUHRE
• A Numerical Method for Locating the Zeros of an Analytic Function

This page was built for publication: A method for solving stationary equations for priority time-sharing service process in random environment