{"title":"基于高效分支定界算法的制造系统任务调度","authors":"Abolfazl Jalilvand, S. Khanmohammadi","doi":"10.1109/RAMECH.2004.1438929","DOIUrl":null,"url":null,"abstract":"The branch and bound (BB) algorithm is one of the common used methods in solving the task scheduling problems in manufacturing systems. In this paper, we introduced a new method to apply the branch and bound algorithm with a reduced memory size. By this method the running time decreases considerably. The algorithm is applied to a combinational discrete job shop scheduling system, where a Petri net is used for modeling.","PeriodicalId":252964,"journal":{"name":"IEEE Conference on Robotics, Automation and Mechatronics, 2004.","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Task scheduling in manufacturing systems based on an efficient branch and bound algorithm\",\"authors\":\"Abolfazl Jalilvand, S. Khanmohammadi\",\"doi\":\"10.1109/RAMECH.2004.1438929\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The branch and bound (BB) algorithm is one of the common used methods in solving the task scheduling problems in manufacturing systems. In this paper, we introduced a new method to apply the branch and bound algorithm with a reduced memory size. By this method the running time decreases considerably. The algorithm is applied to a combinational discrete job shop scheduling system, where a Petri net is used for modeling.\",\"PeriodicalId\":252964,\"journal\":{\"name\":\"IEEE Conference on Robotics, Automation and Mechatronics, 2004.\",\"volume\":\"293 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Conference on Robotics, Automation and Mechatronics, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAMECH.2004.1438929\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Robotics, Automation and Mechatronics, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMECH.2004.1438929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Task scheduling in manufacturing systems based on an efficient branch and bound algorithm
The branch and bound (BB) algorithm is one of the common used methods in solving the task scheduling problems in manufacturing systems. In this paper, we introduced a new method to apply the branch and bound algorithm with a reduced memory size. By this method the running time decreases considerably. The algorithm is applied to a combinational discrete job shop scheduling system, where a Petri net is used for modeling.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
