Entropy maximization and the busy period of some single-server vacation models

DOI10.1051/ro:2004020zbMath1158.90330OpenAlexW2030166733MaRDI QIDQ4822690

Maria Jesus Lopez-Herrero, Jesus R. Artalejo

Publication date: 25 October 2004

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2004__38_3_195_0

zbMATH Keywords

numerical inversion\(M/G/1\) vacation modelsBusy period analysismaximum entropy methodology

Mathematics Subject Classification ID

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

Related Items

Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations ⋮ Steady state analysis of an \(M^x/G/1\) queue with two phase service and Bernoulli vacation schedule under multiple vacation policy ⋮ Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation ⋮ Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control of the service process in a queueing system
• Queueing systems with vacations - a survey
• Information theoretic approximations for M/G/1 and G/G/1 queuing systems
• A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium
• Entropy maximisation and queueing network models
• \(G\)-networks: A unifying model for neural and queueing networks
• Information theoretic approximations for the \(M/G/1\) retrial queue
• On the M/G/1 queue with \(D\)-policy
• \(G\)-networks: A versatile approach for work removal in queueing networks
• Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with a removable server
• Maximum Entropy Condition in Queueing Theory
• A maximum entropy method for inverting Laplace transforms of probability density functions
• Product-form queueing networks with negative and positive customers
• Utilization of Idle Time in an M/G/1 Queueing System
• Comment on “Solving the ‘Marketing Mix’ Problem using Geometric Programming”
• The T-Policy for the M/G/1 Queue
• Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
• Numerical Inversion of Laplace Transforms of Probability Distributions
• A Simplex Method for Function Minimization
• Maximum entropy solution to a quorum queueing system