{"title":"开放问题- m /G/1具有抢占延迟的调度","authors":"Ziv Scully","doi":"10.1287/stsy.2019.0047","DOIUrl":null,"url":null,"abstract":"The problem of preemptively scheduling jobs in the M/G/1 queue to minimize mean response time is a classic problem in computer systems. Typically, one assumes that the time it takes to preempt a jo...","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.0047","citationCount":"1","resultStr":"{\"title\":\"Open Problem—M/G/1 Scheduling with Preemption Delays\",\"authors\":\"Ziv Scully\",\"doi\":\"10.1287/stsy.2019.0047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of preemptively scheduling jobs in the M/G/1 queue to minimize mean response time is a classic problem in computer systems. Typically, one assumes that the time it takes to preempt a jo...\",\"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.0047\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Stochastic Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/stsy.2019.0047\",\"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.0047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
Open Problem—M/G/1 Scheduling with Preemption Delays
The problem of preemptively scheduling jobs in the M/G/1 queue to minimize mean response time is a classic problem in computer systems. Typically, one assumes that the time it takes to preempt a jo...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
