MAP/PH/1 queueing model with working vacation and crowdsourcing

DOI10.14708/MA.V44I2.1244MaRDI QIDQ5357652zbMATH OpenOpenAlexFDO

Authors Srinivas R. Chakravarthy, Serife Ozkar

Publication date 12 September 2017

Published in Mathematica Applicanda (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14708/ma.v44i2.1244

zbMATH Keywords

queueingMarkovian arrival processquasi-birth-and-death processmatrix-analytic methodphase typecrowdsourcing

Mathematics Subject Classification ID

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

Recommendations

• MAP/PH/1 queue with working vacations, vacation interruptions and N policy
• An \(M/ PH /1\) queue with workload-dependent processing speed and vacations
• The discrete-time \(MAP/PH/1\) queue with multiple working vacations
• \(M/C_k /1\) queue model with multiple working vacations
• An M/G/1 queueing model with vacation times
• TIME-DEPENDENT DISTRIBUTION OF THE WORKLOAD IN M/G/1 QUEUES WITH VACATIONS
• Distribution of the workload in multiclass queueing systems with server vacations

Cited in

(4)

• Analysis of a stochastic model for crowdsourcing using map arrivals and phase type services
• Analysis of a MAP/PH(1), PH(2)/2 production inventory system under the Bernoulli vacation scheme
• Algorithmic computation of \(MAP/PH/1\) queue with finite system capacity and two-stage vacations
• Impact of the degradation in service rate in \({MAP}/{PH}/1\) queueing system with phase type vacations, breakdowns, and repairs

This page was built for publication: MAP/PH/1 queueing model with working vacation and crowdsourcing

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