双机流水车间总延迟问题的混合元启发式、混合下界和禁忌搜索

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI:10.1109/RIVF.2013.6719893

Q. Ta, J. Billaut, J. Bouquard

{"title":"双机流水车间总延迟问题的混合元启发式、混合下界和禁忌搜索","authors":"Q. Ta, J. Billaut, J. Bouquard","doi":"10.1109/RIVF.2013.6719893","DOIUrl":null,"url":null,"abstract":"The classical F2∥ΣTj problem is considered. A Tabu search and a matheuristic algorithm are proposed as upper bounds and a lower bound based on a partial relaxation of the MILP model is proposed. All these methods have been extensively tested on randomly generated instances. The results show the performances of the Tabu search algorithm. They also show the good performances of the matheuristic and of the lower bound, preferably for small instances (up to 100 jobs).","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem\",\"authors\":\"Q. Ta, J. Billaut, J. Bouquard\",\"doi\":\"10.1109/RIVF.2013.6719893\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classical F2∥ΣTj problem is considered. A Tabu search and a matheuristic algorithm are proposed as upper bounds and a lower bound based on a partial relaxation of the MILP model is proposed. All these methods have been extensively tested on randomly generated instances. The results show the performances of the Tabu search algorithm. They also show the good performances of the matheuristic and of the lower bound, preferably for small instances (up to 100 jobs).\",\"PeriodicalId\":121216,\"journal\":{\"name\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2013.6719893\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2013.6719893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

考虑经典的F2∥ΣTj问题。提出了禁忌搜索和数学算法作为上界，提出了基于部分松弛的MILP模型的下界。所有这些方法都在随机生成的实例上进行了广泛的测试。实验结果表明了禁忌搜索算法的性能。它们还显示了数学和下界的良好性能，特别是对于小实例(最多100个工作)。

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

查看原文本刊更多论文

An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem

The classical F2∥ΣTj problem is considered. A Tabu search and a matheuristic algorithm are proposed as upper bounds and a lower bound based on a partial relaxation of the MILP model is proposed. All these methods have been extensively tested on randomly generated instances. The results show the performances of the Tabu search algorithm. They also show the good performances of the matheuristic and of the lower bound, preferably for small instances (up to 100 jobs).

求助全文

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

来源期刊

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)

自引率

0.00%

发文量