{"title":"多服务器随机调度中的最优策略","authors":"R. Weber, P. Nash","doi":"10.1111/J.2517-6161.1978.TB01045.X","DOIUrl":null,"url":null,"abstract":"SUMMARY Identical components are available for use in a piece of machinery. The number of components needed to operate the machine is a function of time and the lifetime of each component is described by a known probability distribution. Once a certain number of components have failed there will not be enough left to operate the machine. We find a strategy which for certain lifetime distributions delays this occurrence for as long as possible.","PeriodicalId":17425,"journal":{"name":"Journal of the royal statistical society series b-methodological","volume":"72 1","pages":"322-327"},"PeriodicalIF":0.0000,"publicationDate":"1978-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An Optimal Strategy in Multi-server Stochastic Scheduling\",\"authors\":\"R. Weber, P. Nash\",\"doi\":\"10.1111/J.2517-6161.1978.TB01045.X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SUMMARY Identical components are available for use in a piece of machinery. The number of components needed to operate the machine is a function of time and the lifetime of each component is described by a known probability distribution. Once a certain number of components have failed there will not be enough left to operate the machine. We find a strategy which for certain lifetime distributions delays this occurrence for as long as possible.\",\"PeriodicalId\":17425,\"journal\":{\"name\":\"Journal of the royal statistical society series b-methodological\",\"volume\":\"72 1\",\"pages\":\"322-327\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the royal statistical society series b-methodological\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1111/J.2517-6161.1978.TB01045.X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the royal statistical society series b-methodological","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1111/J.2517-6161.1978.TB01045.X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Optimal Strategy in Multi-server Stochastic Scheduling
SUMMARY Identical components are available for use in a piece of machinery. The number of components needed to operate the machine is a function of time and the lifetime of each component is described by a known probability distribution. Once a certain number of components have failed there will not be enough left to operate the machine. We find a strategy which for certain lifetime distributions delays this occurrence for as long as possible.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
