{"title":"多类别排队网络的最优控制与调度:结果与猜想","authors":"P. Yang, H. Chen, D. Yao","doi":"10.1109/CDC.1990.203663","DOIUrl":null,"url":null,"abstract":"Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit stations, 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented.<<ETX>>","PeriodicalId":287089,"journal":{"name":"29th IEEE Conference on Decision and Control","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Optimal control and scheduling in a multiclass queueing network: results and conjectures\",\"authors\":\"P. Yang, H. Chen, D. Yao\",\"doi\":\"10.1109/CDC.1990.203663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit stations, 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented.<<ETX>>\",\"PeriodicalId\":287089,\"journal\":{\"name\":\"29th IEEE Conference on Decision and Control\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"29th IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1990.203663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1990.203663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal control and scheduling in a multiclass queueing network: results and conjectures
Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit stations, 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
