Relationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queues

DOI10.1007/s12597-015-0220-yzbMath1360.90092OpenAlexW1956905697MaRDI QIDQ522361

Veena Goswami

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

zbMATH Keywords

queuediscrete-time\((p, F)\)-policy\((q, N)\)-policystart-up

Mathematics Subject Classification ID

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

Related Items (4)

Computational analysis and optimization of randomized control of N-policy for an M/G/1/K queue with starting failures ⋮ Queueing modeling and optimization of a fault-tolerant system with reboot, recovery, and vacationing server operating under admission control policy ⋮ Performance evaluation and bi-objective optimization for \(F\)-policy queue with alternating service rates ⋮ Cost optimization and ANFIS computing for admission control of \(M/M/1/K\) queue with general retrial times and discouragement

Cites Work

• \(M/G/1/K\) queues with \(N\)-policy and setup times
• Optimal design and control of queues
• A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time
• The randomized threshold for the discrete-time geo/G/1 queue
• 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
• 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
• A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
• 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 discrete-time single-server queue with a modifiedN-policy
• A Note On Operating Policies For The Queue M/M/1 With Exponential Startups

This page was built for publication: Relationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queues