Relationship between randomized F-policy and randomized N-policy in discrete-time queues
From MaRDI portal
Publication:522361
DOI10.1007/S12597-015-0220-YzbMATH Open1360.90092OpenAlexW1956905697MaRDI QIDQ522361FDOQ522361
Publication date: 28 April 2017
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-015-0220-y
Recommendations
- Interrelationship between controlling arrival and service in queueing systems
- Analysis of a discrete-time \(\mathrm{Geo}^{\lambda_1,\lambda_2}/\mathrm{G}/1\) queue with \(N\)-policy and \(D\)-policy
- scientific article; zbMATH DE number 706393
- Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time
- Random \(N\)-policy Geo/G/1 queue with startup and closedown times
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Controlling arrivals for a queueing system with an unreliable server: Newton-quasi method
- Poisson input queueing system with startup time and under control- operating policy
- Interrelationship between controlling arrival and service in queueing systems
- Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time
- A Note On Operating Policies For The Queue M/M/1 With Exponential Startups
- A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time
- Optimal design and control of queues
- A discrete-time single-server queue with a modifiedN-policy
- A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
- A Poisson input queue under \(N\)-policy and with a general start up time
- Duality relations for queues with arrival and service control
- The operating characteristic analysis on a general input queue with \(N\) policy and a startup time
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- \(M/G/1/K\) queues with \(N\)-policy and setup times
- The randomized threshold for the discrete-time geo/G/1 queue
Cited In (4)
- Queueing modeling and optimization of a fault-tolerant system with reboot, recovery, and vacationing server operating under admission control policy
- Cost optimization and ANFIS computing for admission control of \(M/M/1/K\) queue with general retrial times and discouragement
- Performance evaluation and bi-objective optimization for \(F\)-policy queue with alternating service rates
- Computational analysis and optimization of randomized control of N-policy for an M/G/1/K queue with starting failures
This page was built for publication: Relationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522361)