{"title":"双机流水车间总完工时间问题的新逼近算法","authors":"D. Bai, Tao Ren, Hongmei Li","doi":"10.1109/WCICA.2012.6358272","DOIUrl":null,"url":null,"abstract":"This paper considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2||ΣC<sub>j</sub> and F2|r<sub>j</sub>|ΣC<sub>j</sub> respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee are provided for problems F2||ΣC<sub>j</sub> and F2|r<sub>j</sub>|ΣC<sub>j</sub>, respectively. At the end of the paper, a series of simulation experiments are conducted to show the effectiveness of the new heuristics.","PeriodicalId":114901,"journal":{"name":"Proceedings of the 10th World Congress on Intelligent Control and Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New approximation algorithms for two-machine flow shop total completion time problem\",\"authors\":\"D. Bai, Tao Ren, Hongmei Li\",\"doi\":\"10.1109/WCICA.2012.6358272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2||ΣC<sub>j</sub> and F2|r<sub>j</sub>|ΣC<sub>j</sub> respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee are provided for problems F2||ΣC<sub>j</sub> and F2|r<sub>j</sub>|ΣC<sub>j</sub>, respectively. At the end of the paper, a series of simulation experiments are conducted to show the effectiveness of the new heuristics.\",\"PeriodicalId\":114901,\"journal\":{\"name\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2012.6358272\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2012.6358272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New approximation algorithms for two-machine flow shop total completion time problem
This paper considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2||ΣCj and F2|rj|ΣCj respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee are provided for problems F2||ΣCj and F2|rj|ΣCj, respectively. At the end of the paper, a series of simulation experiments are conducted to show the effectiveness of the new heuristics.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
