Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
A GRASP for a difficult single machine scheduling problem
Computers and Operations Research
A structured view of real-time problem solving
AI Magazine
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scheduling of time critical processes
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Sensitivity analysis and the “what if” problem in simulation analysis
Mathematical and Computer Modelling: An International Journal
Generalized estimates for performance sensitivities of stochastic systems
Mathematical and Computer Modelling: An International Journal
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
Real-time system with homogeneous servers and nonidentical channels in steady-state
Computers and Operations Research
Mathematics and Computers in Simulation
| Hi-index | 0.98 |
We consider a real-time multiserver (such as unmanned air vehicles or machine controllers) and multichannel (such as surveillance regions or assembly lines) systems working under maximum load regime with shortage of maintenance crews (less than the number of servers). In such systems, a job arriving is served immediately upon arrival (conditional on system availability) without delay. That part of the job which is not served immediately is lost forever and cannot be processed later. We show how to compute equilibrium (steady state) probabilities of real-time systems, when both maintenance and service times are exponentially distributed (birth and death stochastic process). Then we also compute various important system parameters (including its availability) and provide some numerical results.