{"id":"https://openalex.org/W2015229088","doi":"https://doi.org/10.1017/s0269964800001121","title":"Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems","display_name":"Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W2015229088","doi":"https://doi.org/10.1017/s0269964800001121","mag":"2015229088"},"language":"en","primary_location":{"id":"doi:10.1017/s0269964800001121","doi":"https://doi.org/10.1017/s0269964800001121","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269964800001121","pdf_url":null,"source":{"id":"https://openalex.org/S203441484","display_name":"Probability in the Engineering and Informational Sciences","issn_l":"0269-9648","issn":["0269-9648","1469-8951"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-2"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Probability in the Engineering and Informational Sciences","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046206433","display_name":"Linn I. Sennott","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I47301684","display_name":"Illinois State University","ror":"https://ror.org/050kcr883","country_code":"US","type":"education","lineage":["https://openalex.org/I47301684"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Linn I. Sennott","raw_affiliation_strings":["Department of Mathematics Illinois State University Normal, Illinois 61761"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics Illinois State University Normal, Illinois 61761","institution_ids":["https://openalex.org/I47301684"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046206433"],"corresponding_institution_ids":["https://openalex.org/I47301684"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":10.2058,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.98386076,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"2","first_page":"247","last_page":"272"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11720","display_name":"Probability and Risk Models","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semi-markov-decision-process","display_name":"semi-Markov decision process","score":0.9750000238418579},{"id":"https://openalex.org/keywords/optimal-stationary-policy","display_name":"stationary optimal policy","score":0.6809999942779541},{"id":"https://openalex.org/keywords/existence-of-optimal-policies","display_name":"existence of optimal policies","score":0.765999972820282},{"id":"https://openalex.org/keywords/unbounded-costs","display_name":"unbounded costs","score":0.7379999756813049},{"id":"https://openalex.org/keywords/m-g-1-queue","display_name":"M/G/1 queue","score":0.8529999852180481},{"id":"https://openalex.org/keywords/batch-processing","display_name":"batch processing","score":0.8980000019073486},{"id":"https://openalex.org/keywords/customer-rejection","display_name":"customer rejection","score":0.9039999842643738},{"id":"https://openalex.org/keywords/variable-arrival-rate","display_name":"variable arrival rate","score":0.7070000171661377},{"id":"https://openalex.org/keywords/route-optimization","display_name":"route optimization","score":0.7049999833106995},{"id":"https://openalex.org/keywords/poisson-arrivals","display_name":"Poisson arrivals","score":0.8479999899864197}],"concepts":[{"id":"https://openalex.org/C87950461","wikidata":"https://www.wikidata.org/wiki/Q4996486","display_name":"Bulk queue","level":3,"score":0.6236680746078491},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5953792929649353},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5890791416168213},{"id":"https://openalex.org/C129978463","wikidata":"https://www.wikidata.org/wiki/Q6803663","display_name":"Mean value analysis","level":4,"score":0.5679382681846619},{"id":"https://openalex.org/C33891772","wikidata":"https://www.wikidata.org/wiki/Q6505536","display_name":"Layered queueing network","level":3,"score":0.5575312376022339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5510761737823486},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5247963666915894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5199148058891296},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.5138218998908997},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.513237714767456},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.4741615355014801},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39519253373146057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38947033882141113},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3781740069389343},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.2584197521209717},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1363481879234314},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08020535111427307},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0269964800001121","doi":"https://doi.org/10.1017/s0269964800001121","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269964800001121","pdf_url":null,"source":{"id":"https://openalex.org/S203441484","display_name":"Probability in the Engineering and Informational Sciences","issn_l":"0269-9648","issn":["0269-9648","1469-8951"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-2"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Probability in the Engineering and Informational Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, justice, and strong institutions","score":0.6200000047683716}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W604756028","https://openalex.org/W1512938982","https://openalex.org/W1515687042","https://openalex.org/W1545148916","https://openalex.org/W1574558330","https://openalex.org/W1985016150","https://openalex.org/W1991513691","https://openalex.org/W1999847533","https://openalex.org/W2033474053","https://openalex.org/W2035663218","https://openalex.org/W2059442555","https://openalex.org/W2065284701","https://openalex.org/W2073280806","https://openalex.org/W2107037985","https://openalex.org/W2109174772","https://openalex.org/W2120580463","https://openalex.org/W2139812466","https://openalex.org/W2152684927","https://openalex.org/W2321514732","https://openalex.org/W2322096602","https://openalex.org/W2324377458","https://openalex.org/W2798198027","https://openalex.org/W4236227779","https://openalex.org/W4301031214","https://openalex.org/W4400449507"],"related_works":["https://openalex.org/W274497311","https://openalex.org/W1994006836","https://openalex.org/W2025030740","https://openalex.org/W2322096602","https://openalex.org/W2017531590","https://openalex.org/W2333934723","https://openalex.org/W92874942","https://openalex.org/W2331566366","https://openalex.org/W2056691655","https://openalex.org/W2322044935"],"abstract_inverted_index":{"Semi-Markov":[0],"decision":[1,19,53],"processes":[2,20],"underlie":[3],"the":[4,31,46,58,71,89,128],"control":[5,69,87],"of":[6,33,70,88,106,117],"many":[7],"queueing":[8],"systems.":[9],"In":[10],"this":[11],"paper,":[12],"we":[13],"deal":[14],"with":[15,21,74,78,82,92,108],"infinite":[16],"state":[17],"semi-Markov":[18],"nonnegative,":[22],"unbounded":[23],"costs":[24],"and":[25,81,85,96,112],"finite":[26],"action":[27,133],"sets.":[28],"Axioms":[29],"for":[30,51,57],"existence":[32,129],"an":[34],"expected":[35],"average":[36],"cost":[37],"optimal":[38,115],"stationary":[39],"policy":[40],"are":[41,62],"presented.":[42],"These":[43],"conditions":[44,56],"generalize":[45],"work":[47],"in":[48],"Sennott":[49],"[22]":[50],"Markov":[52],"processes.":[54],"Verifiable":[55],"axioms":[59],"to":[60,68,86,102,114,120,131],"hold":[61],"obtained.":[63],"The":[64,124],"theory":[65],"is":[66,100],"applied":[67,101],"M/G/l":[72],"queue":[73,91],"variable":[75,93],"service":[76],"parameter,":[77],"on-off":[79],"server,":[80],"batch":[83],"processing,":[84],"G/M/m":[90],"arrival":[94],"parameter":[95],"customer":[97],"rejection.":[98],"It":[99],"a":[103,109],"timesharing":[104],"network":[105],"queues":[107],"single":[110],"server":[111],"finally":[113],"routing":[116],"Poisson":[118],"arrivals":[119],"parallel":[121],"exponential":[122],"servers.":[123],"final":[125],"section":[126],"extends":[127],"result":[130],"compact":[132],"spaces.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}