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

DOI10.1051/RO:2004020MaRDI QIDQ4822690zbMATH OpenOpenAlexFDO

Authors M. J. 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, https://eudml.org/doc/105310, https://eprints.ucm.es/15682/1/arta37.pdf

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• A maximum entropy approach for the busy period of the \(M/G/1\) retrial queue
• Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size
• Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation
• Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations
• A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium

Cites work

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

Cited in

(5)

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

This page was built for publication: Entropy maximization and the busy period of some single-server vacation models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822690)