{"title":"在被初始负载锁定的单机上重新调度返工作业","authors":"Ya Guo, Min Huang, Qing Wang","doi":"10.1109/ICSSSM.2013.6602657","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of Rescheduling Rework Jobs on Single Machine (RRJSM) is investigated. Suppose that a single machine has a set of the initial loads locked for some desired purposes. The objective of RRJSM is to minimize the maximum waiting time of rework jobs by scheduling or inserting them into the locked initial loads. Firstly, the RRJSM problem is formulated and proved to be NP-hard as for computational complexity. Secondly, two properties of RRJSM problem are addressed. Furthermore, a heuristic algorithm is designed basing on the properties and its complexity is given as well. Finally, the optimality condition of the algorithm and the judgment of optimal solution are given and proved respectively.","PeriodicalId":354195,"journal":{"name":"2013 10th International Conference on Service Systems and Service Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Rescheduling Rework Jobs on Single Machine locked by initial loads\",\"authors\":\"Ya Guo, Min Huang, Qing Wang\",\"doi\":\"10.1109/ICSSSM.2013.6602657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problem of Rescheduling Rework Jobs on Single Machine (RRJSM) is investigated. Suppose that a single machine has a set of the initial loads locked for some desired purposes. The objective of RRJSM is to minimize the maximum waiting time of rework jobs by scheduling or inserting them into the locked initial loads. Firstly, the RRJSM problem is formulated and proved to be NP-hard as for computational complexity. Secondly, two properties of RRJSM problem are addressed. Furthermore, a heuristic algorithm is designed basing on the properties and its complexity is given as well. Finally, the optimality condition of the algorithm and the judgment of optimal solution are given and proved respectively.\",\"PeriodicalId\":354195,\"journal\":{\"name\":\"2013 10th International Conference on Service Systems and Service Management\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2013.6602657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2013.6602657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rescheduling Rework Jobs on Single Machine locked by initial loads
In this paper, the problem of Rescheduling Rework Jobs on Single Machine (RRJSM) is investigated. Suppose that a single machine has a set of the initial loads locked for some desired purposes. The objective of RRJSM is to minimize the maximum waiting time of rework jobs by scheduling or inserting them into the locked initial loads. Firstly, the RRJSM problem is formulated and proved to be NP-hard as for computational complexity. Secondly, two properties of RRJSM problem are addressed. Furthermore, a heuristic algorithm is designed basing on the properties and its complexity is given as well. Finally, the optimality condition of the algorithm and the judgment of optimal solution are given and proved respectively.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
