{"title":"用分支定界算法求解阻塞式流水车间调度问题","authors":"Said Toumi, B. Jarboui, M. Eddaly, A. Rebai","doi":"10.1109/ICADLT.2013.6568494","DOIUrl":null,"url":null,"abstract":"In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"145 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Solving blocking flowshop scheduling problem with branch and bound algorithm\",\"authors\":\"Said Toumi, B. Jarboui, M. Eddaly, A. Rebai\",\"doi\":\"10.1109/ICADLT.2013.6568494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.\",\"PeriodicalId\":269509,\"journal\":{\"name\":\"2013 International Conference on Advanced Logistics and Transport\",\"volume\":\"145 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Advanced Logistics and Transport\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICADLT.2013.6568494\",\"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 International Conference on Advanced Logistics and Transport","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICADLT.2013.6568494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving blocking flowshop scheduling problem with branch and bound algorithm
In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
