2012
DOI: 10.3934/jimo.2012.8.1
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic algorithm for the optimization of M/M/$s$ queue with multiple working vacations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Jain and Jain [53] studied a single server working vacation queueing model with multiple types of server breakdowns and proposed a matrix geometric approach for computing the stationary queue length distribution. Wu et al [137] studied a ‫ݏ/ܯ/ܯ‬ queueing system with multiple working vacations. They applied the direct search method and Quasi-Newton method to get an approximate solution to the constrained optimization problem.…”
Section: (Ii) Working Vacations Markovian Queueingmentioning
confidence: 99%
“…Jain and Jain [53] studied a single server working vacation queueing model with multiple types of server breakdowns and proposed a matrix geometric approach for computing the stationary queue length distribution. Wu et al [137] studied a ‫ݏ/ܯ/ܯ‬ queueing system with multiple working vacations. They applied the direct search method and Quasi-Newton method to get an approximate solution to the constrained optimization problem.…”
Section: (Ii) Working Vacations Markovian Queueingmentioning
confidence: 99%