{"title":"具有抢占的单机问题最优解的组合结构","authors":"K. A. Chernykh, V. Servakh","doi":"10.1109/OPCS.2019.8880148","DOIUrl":null,"url":null,"abstract":"The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combinatorial Structure of Optimal Solutions to the Problem of a Single Machine with Preemption\",\"authors\":\"K. A. Chernykh, V. Servakh\",\"doi\":\"10.1109/OPCS.2019.8880148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combinatorial Structure of Optimal Solutions to the Problem of a Single Machine with Preemption
The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
