A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the F-policy and an exponential startup time before start allowing customers in the system. The F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We p...
Gespeichert in:
| Veröffentlicht in: | Applied mathematical modelling 2008-06, Vol.32 (6), p.958-970 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 970 |
|---|---|
| container_issue | 6 |
| container_start_page | 958 |
| container_title | Applied mathematical modelling |
| container_volume | 32 |
| creator | Wang, Kuo-Hsiung Kuo, Ching-Chang Pearn, W.L. |
| description | This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the
F-policy and an exponential startup time before start allowing customers in the system. The
F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distribution of the number of customers in the system. We illustrate a recursive method by presenting three simple examples for exponential, 3-stage Erlang, and deterministic interarrival time distributions, respectively. A cost model is developed to determine the optimal management
F-policy at minimum cost. We use an efficient Maple computer program to determine the optimal operating
F-policy and some system performance measures. Sensitivity analysis is also studied. |
| doi_str_mv | 10.1016/j.apm.2007.02.023 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_32606695</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0307904X07000637</els_id><sourcerecordid>32606695</sourcerecordid><originalsourceid>FETCH-LOGICAL-c401t-bdf098c1e01bf2d42f4b8ff07bfd062cc15ee8242c35771bbc1ca8c4c1271b793</originalsourceid><addsrcrecordid>eNp9UMtOwzAQzAEkyuMDuPkCtzRrJ00acaoQL1HEBSQOSJazWVNXeWE7hf49Rq04Io20Gmlmdnei6JzDlAPPk_VUDe1UABRTEAHpQTSBFIq4hOztKDp2bg0As8Am0fuCWcLROrMh1pJf9TXTvWV-Rew2HvrG4JbdJU8JTx7Z50gjme6Dua3z1LIv41dMdYy-h76jzhvVMOeV9ePAvGnpNDrUqnF0tp8n0evtzcv1fbx8vnu4XixjzID7uKo1lHPkBLzSos6Ezqq51lBUuoZcIPIZ0VxkAtNZUfCqQo5qjhlyEVhRpifR5S53sH240XnZGofUNKqjfnQyFTnkeTkLQr4Tou2ds6TlYE2r7FZykL_dybUM3cnf7iSIgDR4LvbhyqFqtFUdGvdnFMCztEzzoLva6Sh8ujFkpUNDHVJtQsNe1r35Z8sPzxeGfg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>32606695</pqid></control><display><type>article</type><title>A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time</title><source>ScienceDirect Journals (5 years ago - present)</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Wang, Kuo-Hsiung ; Kuo, Ching-Chang ; Pearn, W.L.</creator><creatorcontrib>Wang, Kuo-Hsiung ; Kuo, Ching-Chang ; Pearn, W.L.</creatorcontrib><description>This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the
F-policy and an exponential startup time before start allowing customers in the system. The
F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distribution of the number of customers in the system. We illustrate a recursive method by presenting three simple examples for exponential, 3-stage Erlang, and deterministic interarrival time distributions, respectively. A cost model is developed to determine the optimal management
F-policy at minimum cost. We use an efficient Maple computer program to determine the optimal operating
F-policy and some system performance measures. Sensitivity analysis is also studied.</description><identifier>ISSN: 0307-904X</identifier><identifier>DOI: 10.1016/j.apm.2007.02.023</identifier><identifier>CODEN: AMMODL</identifier><language>eng</language><publisher>New York, NY: Elsevier Inc</publisher><subject>Applied sciences ; Exact sciences and technology ; F-Policy ; G/M/1/K queue ; Operational research and scientific management ; Operational research. Management science ; Queuing theory. Traffic theory ; Recursive method ; Server startup ; Supplementary variable</subject><ispartof>Applied mathematical modelling, 2008-06, Vol.32 (6), p.958-970</ispartof><rights>2007 Elsevier Inc.</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c401t-bdf098c1e01bf2d42f4b8ff07bfd062cc15ee8242c35771bbc1ca8c4c1271b793</citedby><cites>FETCH-LOGICAL-c401t-bdf098c1e01bf2d42f4b8ff07bfd062cc15ee8242c35771bbc1ca8c4c1271b793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0307904X07000637$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20143936$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wang, Kuo-Hsiung</creatorcontrib><creatorcontrib>Kuo, Ching-Chang</creatorcontrib><creatorcontrib>Pearn, W.L.</creatorcontrib><title>A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time</title><title>Applied mathematical modelling</title><description>This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the
F-policy and an exponential startup time before start allowing customers in the system. The
F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distribution of the number of customers in the system. We illustrate a recursive method by presenting three simple examples for exponential, 3-stage Erlang, and deterministic interarrival time distributions, respectively. A cost model is developed to determine the optimal management
F-policy at minimum cost. We use an efficient Maple computer program to determine the optimal operating
F-policy and some system performance measures. Sensitivity analysis is also studied.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>F-Policy</subject><subject>G/M/1/K queue</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Queuing theory. Traffic theory</subject><subject>Recursive method</subject><subject>Server startup</subject><subject>Supplementary variable</subject><issn>0307-904X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9UMtOwzAQzAEkyuMDuPkCtzRrJ00acaoQL1HEBSQOSJazWVNXeWE7hf49Rq04Io20Gmlmdnei6JzDlAPPk_VUDe1UABRTEAHpQTSBFIq4hOztKDp2bg0As8Am0fuCWcLROrMh1pJf9TXTvWV-Rew2HvrG4JbdJU8JTx7Z50gjme6Dua3z1LIv41dMdYy-h76jzhvVMOeV9ePAvGnpNDrUqnF0tp8n0evtzcv1fbx8vnu4XixjzID7uKo1lHPkBLzSos6Ezqq51lBUuoZcIPIZ0VxkAtNZUfCqQo5qjhlyEVhRpifR5S53sH240XnZGofUNKqjfnQyFTnkeTkLQr4Tou2ds6TlYE2r7FZykL_dybUM3cnf7iSIgDR4LvbhyqFqtFUdGvdnFMCztEzzoLva6Sh8ujFkpUNDHVJtQsNe1r35Z8sPzxeGfg</recordid><startdate>20080601</startdate><enddate>20080601</enddate><creator>Wang, Kuo-Hsiung</creator><creator>Kuo, Ching-Chang</creator><creator>Pearn, W.L.</creator><general>Elsevier Inc</general><general>Elsevier Science</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080601</creationdate><title>A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time</title><author>Wang, Kuo-Hsiung ; Kuo, Ching-Chang ; Pearn, W.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c401t-bdf098c1e01bf2d42f4b8ff07bfd062cc15ee8242c35771bbc1ca8c4c1271b793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>F-Policy</topic><topic>G/M/1/K queue</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Queuing theory. Traffic theory</topic><topic>Recursive method</topic><topic>Server startup</topic><topic>Supplementary variable</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Kuo-Hsiung</creatorcontrib><creatorcontrib>Kuo, Ching-Chang</creatorcontrib><creatorcontrib>Pearn, W.L.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Applied mathematical modelling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Kuo-Hsiung</au><au>Kuo, Ching-Chang</au><au>Pearn, W.L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time</atitle><jtitle>Applied mathematical modelling</jtitle><date>2008-06-01</date><risdate>2008</risdate><volume>32</volume><issue>6</issue><spage>958</spage><epage>970</epage><pages>958-970</pages><issn>0307-904X</issn><coden>AMMODL</coden><abstract>This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the
F-policy and an exponential startup time before start allowing customers in the system. The
F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distribution of the number of customers in the system. We illustrate a recursive method by presenting three simple examples for exponential, 3-stage Erlang, and deterministic interarrival time distributions, respectively. A cost model is developed to determine the optimal management
F-policy at minimum cost. We use an efficient Maple computer program to determine the optimal operating
F-policy and some system performance measures. Sensitivity analysis is also studied.</abstract><cop>New York, NY</cop><pub>Elsevier Inc</pub><doi>10.1016/j.apm.2007.02.023</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0307-904X |
| ispartof | Applied mathematical modelling, 2008-06, Vol.32 (6), p.958-970 |
| issn | 0307-904X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_32606695 |
| source | ScienceDirect Journals (5 years ago - present); Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Applied sciences Exact sciences and technology F-Policy G/M/1/K queue Operational research and scientific management Operational research. Management science Queuing theory. Traffic theory Recursive method Server startup Supplementary variable |
| title | A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T21%3A42%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20recursive%20method%20for%20the%20F-policy%20G/M/1/K%20queueing%20system%20with%20an%20exponential%20startup%20time&rft.jtitle=Applied%20mathematical%20modelling&rft.au=Wang,%20Kuo-Hsiung&rft.date=2008-06-01&rft.volume=32&rft.issue=6&rft.spage=958&rft.epage=970&rft.pages=958-970&rft.issn=0307-904X&rft.coden=AMMODL&rft_id=info:doi/10.1016/j.apm.2007.02.023&rft_dat=%3Cproquest_cross%3E32606695%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=32606695&rft_id=info:pmid/&rft_els_id=S0307904X07000637&rfr_iscdi=true |