Optimal admission policies for a finite queue with bursty arrivals
Gespeichert in:
| Veröffentlicht in: | Annals of operations research 1991-12, Vol.28 (1), p.243-260 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 260 |
|---|---|
| container_issue | 1 |
| container_start_page | 243 |
| container_title | Annals of operations research |
| container_volume | 28 |
| creator | Lamond, Bernard F. |
| description | |
| doi_str_mv | 10.1007/BF02055584 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF02055584</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF02055584</sourcerecordid><originalsourceid>FETCH-LOGICAL-c229t-d800fed519cd45f86d312ded40f0587e755edf41f42f603db13a35e7e02831643</originalsourceid><addsrcrecordid>eNpFj0FLwzAYQIMoWKcXf0HOQvVLvnxtenTDqTDYRc8la75gpFtn0ir7904UPL3b4z0hrhXcKoD6br4EDURkzYkoFNW6bBDtqShAkykJEc7FRc7vAKCUpULM1_sxbl0vnd_GnOOwk_uhj13kLMOQpJMh7uLI8mPiieVXHN_kZkp5PEiXUvx0fb4UZ-EIvvrjTLwuH14WT-Vq_fi8uF-VndbNWHoLENiTajpvKNjKo9KevYEAZGuuidgHo4LRoQL0G4UOiWsGbVFVBmfi5tfbpSHnxKHdp2N6OrQK2p_79v8evwGgDUxW</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal admission policies for a finite queue with bursty arrivals</title><source>Business Source Complete</source><source>SpringerNature Journals</source><creator>Lamond, Bernard F.</creator><creatorcontrib>Lamond, Bernard F.</creatorcontrib><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/BF02055584</identifier><language>eng</language><ispartof>Annals of operations research, 1991-12, Vol.28 (1), p.243-260</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c229t-d800fed519cd45f86d312ded40f0587e755edf41f42f603db13a35e7e02831643</citedby><cites>FETCH-LOGICAL-c229t-d800fed519cd45f86d312ded40f0587e755edf41f42f603db13a35e7e02831643</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27929,27930</link.rule.ids></links><search><creatorcontrib>Lamond, Bernard F.</creatorcontrib><title>Optimal admission policies for a finite queue with bursty arrivals</title><title>Annals of operations research</title><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><recordid>eNpFj0FLwzAYQIMoWKcXf0HOQvVLvnxtenTDqTDYRc8la75gpFtn0ir7904UPL3b4z0hrhXcKoD6br4EDURkzYkoFNW6bBDtqShAkykJEc7FRc7vAKCUpULM1_sxbl0vnd_GnOOwk_uhj13kLMOQpJMh7uLI8mPiieVXHN_kZkp5PEiXUvx0fb4UZ-EIvvrjTLwuH14WT-Vq_fi8uF-VndbNWHoLENiTajpvKNjKo9KevYEAZGuuidgHo4LRoQL0G4UOiWsGbVFVBmfi5tfbpSHnxKHdp2N6OrQK2p_79v8evwGgDUxW</recordid><startdate>199112</startdate><enddate>199112</enddate><creator>Lamond, Bernard F.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199112</creationdate><title>Optimal admission policies for a finite queue with bursty arrivals</title><author>Lamond, Bernard F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c229t-d800fed519cd45f86d312ded40f0587e755edf41f42f603db13a35e7e02831643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lamond, Bernard F.</creatorcontrib><collection>CrossRef</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lamond, Bernard F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal admission policies for a finite queue with bursty arrivals</atitle><jtitle>Annals of operations research</jtitle><date>1991-12</date><risdate>1991</risdate><volume>28</volume><issue>1</issue><spage>243</spage><epage>260</epage><pages>243-260</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><doi>10.1007/BF02055584</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0254-5330 |
| ispartof | Annals of operations research, 1991-12, Vol.28 (1), p.243-260 |
| issn | 0254-5330 1572-9338 |
| language | eng |
| recordid | cdi_crossref_primary_10_1007_BF02055584 |
| source | Business Source Complete; SpringerNature Journals |
| title | Optimal admission policies for a finite queue with bursty arrivals |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T22%3A18%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20admission%20policies%20for%20a%20finite%20queue%20with%20bursty%20arrivals&rft.jtitle=Annals%20of%20operations%20research&rft.au=Lamond,%20Bernard%20F.&rft.date=1991-12&rft.volume=28&rft.issue=1&rft.spage=243&rft.epage=260&rft.pages=243-260&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/BF02055584&rft_dat=%3Ccrossref%3E10_1007_BF02055584%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |