{"title":"开放问题——关于带违约的多服务器队列的静态优先级调度","authors":"Amy R. Ward","doi":"10.1287/stsy.2019.0048","DOIUrl":null,"url":null,"abstract":"We study the many-server queue shown in Figure 1(a). Customers from class j ∈ {1, 2} arrive according to renewal processes having rate λj > 0 and request processing. There are N ∈ {1, 2,…} servers,...","PeriodicalId":36337,"journal":{"name":"Stochastic Systems","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1287/stsy.2019.0048","citationCount":"1","resultStr":"{\"title\":\"Open Problem—Regarding Static Priority Scheduling for Many-Server Queues with Reneging\",\"authors\":\"Amy R. Ward\",\"doi\":\"10.1287/stsy.2019.0048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the many-server queue shown in Figure 1(a). Customers from class j ∈ {1, 2} arrive according to renewal processes having rate λj > 0 and request processing. There are N ∈ {1, 2,…} servers,...\",\"PeriodicalId\":36337,\"journal\":{\"name\":\"Stochastic Systems\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1287/stsy.2019.0048\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Stochastic Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/stsy.2019.0048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/stsy.2019.0048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
Open Problem—Regarding Static Priority Scheduling for Many-Server Queues with Reneging
We study the many-server queue shown in Figure 1(a). Customers from class j ∈ {1, 2} arrive according to renewal processes having rate λj > 0 and request processing. There are N ∈ {1, 2,…} servers,...