A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
- Author
- WANG, Kuo-Hsiung1 ; KUO, Ching-Chang2 ; PEARN, W. L2
[1] Department of Applied Mathematics, National Chung-Hsing University, Taichung 402, Taiwan, Province of China
[2] Department of Industrial Engineering and Management, National Chiao Tung University, Hsin Chu 30050, Taiwan, Province of China - Source
Applied mathematical modelling. 2008, Vol 32, Num 6, pp 958-970, 13 p ; ref : 20 ref
- CODEN
- AMMODL
- ISSN
- 0307-904X
- Scientific domain
- Control theory, operational research; Civil engineering; Mathematics; Mechanics acoustics
- Publisher
- Elsevier Science, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- F-Policy G/M/1/K queue Recursive method Server startup Supplementary variable
- Keyword (fr)
- Analyse sensibilité Commande optimale Contrainte capacité Evaluation performance File attente M G 1 File attente Loi Erlang Modélisation Méthode récursive Optimisation Politique optimale Probabilité stationnaire Réseau file attente Système attente
- Keyword (en)
- Sensitivity analysis Optimal control Capacity constraint Performance evaluation M G 1 queue Queue Erlang distribution Modeling Recursive method Optimization Optimal policy Steady state probability Queueing network Queueing system
- Keyword (es)
- Análisis sensibilidad Control óptimo Coacción capacidad Evaluación prestación Fila espera M G 1 Fila espera Ley Erlang Modelización Método recursivo Optimización Política óptima Probabilidad estacionaria Red cola espera Sistema fila espera
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A05 Queuing theory. Traffic theory
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20143936
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.apm.2007.02.023 
https://dx.doi.org/10.1016/j.apm.2007.02.023
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Applied mathematical modelling\";s:9:\"\u0000*\u0000stitle\";s:17:\"Appl. math. model\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"32\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"958\";s:8:\"\u0000*\u0000epage\";s:3:\"970\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0307-904X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Kuo-Hsiung\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"KUO, Ching-Chang\";i:1;s:11:\"PEARN, W. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMMODL\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Applied mathematical modelling\";s:9:\"\u0000*\u0000stitle\";s:17:\"Appl. math. model\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"32\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"958\";s:8:\"\u0000*\u0000epage\";s:3:\"970\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0307-904X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Kuo-Hsiung\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"KUO, Ching-Chang\";i:1;s:11:\"PEARN, W. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMMODL\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Applied mathematical modelling\";s:9:\"\u0000*\u0000stitle\";s:17:\"Appl. math. model\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"32\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"958\";s:8:\"\u0000*\u0000epage\";s:3:\"970\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0307-904X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Kuo-Hsiung\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"KUO, Ching-Chang\";i:1;s:11:\"PEARN, W. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMMODL\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Applied mathematical modelling\";s:9:\"\u0000*\u0000stitle\";s:17:\"Appl. math. model\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"32\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"958\";s:8:\"\u0000*\u0000epage\";s:3:\"970\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0307-904X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Kuo-Hsiung\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"KUO, Ching-Chang\";i:1;s:11:\"PEARN, W. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMMODL\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.apm.2007.02.023\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Applied mathematical modelling\";s:9:\"\u0000*\u0000stitle\";s:17:\"Appl. math. model\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"32\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"958\";s:8:\"\u0000*\u0000epage\";s:3:\"970\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0307-904X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Kuo-Hsiung\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"KUO, Ching-Chang\";i:1;s:11:\"PEARN, W. L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMMODL\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:92:\"A recursive method for the F-policy G\/M\/1\/K queueing system with an exponential startup time\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
