{"title":"具有冲突作业的有能力调度问题","authors":"Minh Hoàng Hà, Duy Manh Vu, Y. Zinder, T. Nguyen","doi":"10.1109/KSE.2019.8919323","DOIUrl":null,"url":null,"abstract":"The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On The Capacitated Scheduling Problem with Conflict Jobs\",\"authors\":\"Minh Hoàng Hà, Duy Manh Vu, Y. Zinder, T. Nguyen\",\"doi\":\"10.1109/KSE.2019.8919323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments.\",\"PeriodicalId\":439841,\"journal\":{\"name\":\"2019 11th International Conference on Knowledge and Systems Engineering (KSE)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 11th International Conference on Knowledge and Systems Engineering (KSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE.2019.8919323\",\"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 11th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2019.8919323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On The Capacitated Scheduling Problem with Conflict Jobs
The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
