基于高效分支定界算法的制造系统任务调度

IEEE Conference on Robotics, Automation and Mechatronics, 2004. Pub Date : 2004-12-01 DOI:10.1109/RAMECH.2004.1438929

Abolfazl Jalilvand, S. Khanmohammadi

{"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}

引用次数: 3

摘要

分支定界(BB)算法是解决制造系统任务调度问题的常用方法之一。本文介绍了一种应用分支定界算法的新方法，减少了内存大小。通过这种方法，运行时间大大缩短。将该算法应用于一个组合离散作业车间调度系统，并采用Petri网进行建模。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Conference on Robotics, Automation and Mechatronics, 2004.

自引率

0.00%

发文量