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