Controlling arrivals for a queueing system with an unreliable server: Newton-quasi method

DOI10.1016/j.amc.2009.03.002zbMath1167.65329OpenAlexW2165390657MaRDI QIDQ1030220

Dong-Yuh Yang, Kuo-Hsiung Wang

Publication date: 1 July 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.03.002

zbMATH Keywords

startupoptimizationnumerical resultsnumerical examplesmatrix analytical methodPoisson processserver breakdowns\(F\)-policyM/M/1/K queueing systemNewton-quasi method

Mathematics Subject Classification ID

Related Items (12)

Double orbit finite retrial queues with priority customers and service interruptions ⋮ Threshold control policy for maintainability of manufacturing system with unreliable workstations ⋮ Optimal control F-policy for m/M/R/\(K\) queue with an additional server and balking ⋮ Cost optimization and ANFIS computing of an unreliable M/M/1 queueing system with customers' impatience under \(N\)-policy ⋮ Markov model for fault tolerant machining system operating under admission control policy ⋮ Performance analysis and control F-policy for fault-tolerant system with working vacation ⋮ Performance analysis and cost investigations for state-dependent single unreliable server finite queue under \(F\)-policy using GA and QNM ⋮ \(GI/Geom/1/N/MWV\) queue with changeover time and searching for the optimum service rate in working vacation period ⋮ Relationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queues ⋮ Markovian analysis of unreliable multi-components redundant fault tolerant system with working vacation and F-policy ⋮ A parametric programming solution to theF-policy queue with fuzzy parameters ⋮ Machine repair problem with an unreliable server and controlled arrival of failed machines

Cites Work

• Unnamed Item
• \(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
• 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
• Complementarity and equivalence in finite source queueing models with spares
• Duality relations for queues with arrival and service control
• Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
• A matrix analytic solution to a hysteretic queueing system with random server capacity
• Interrelationship between controlling arrival and service in queueing systems
• Optimal control of a removable and non-reliable server in an infinite and a finite \(M/H_2/1\) queueing system
• Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time
• Control Policies of an M/G/1 Queueing System with a Removable and Non-reliable Server
• Optimal Control of an M/E k /1 Queueing System with Removable Service Station Subject to Breakdowns
• Optimal strategy in N-policy production system with early set-up
• A Note On Operating Policies For The Queue M/M/1 With Exponential Startups

This page was built for publication: Controlling arrivals for a queueing system with an unreliable server: Newton-quasi method