{"id":"https://openalex.org/W2059831130","doi":"https://doi.org/10.1109/rivf.2013.6719893","title":"An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem","display_name":"An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2059831130","doi":"https://doi.org/10.1109/rivf.2013.6719893","mag":"2059831130"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2013.6719893","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing &amp; Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045678939","display_name":"Quang Chieu Ta","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Quang Chieu Ta","raw_affiliation_strings":["Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]},{"raw_affiliation_string":"Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108073087","display_name":"Jean\u2010Charles Billaut","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Charles Billaut","raw_affiliation_strings":["Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]},{"raw_affiliation_string":"Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109808241","display_name":"Jean-Louis Bouquard","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Louis Bouquard","raw_affiliation_strings":["Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, Universit\u00e9 Fran\u00e7ois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]},{"raw_affiliation_string":"Lab. d'Inf., Univ. Francois Rabelais Tours, Tours, France","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.699,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.76800981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":null,"first_page":"198","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.9579468965530396},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.8524843454360962},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6747055649757385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6448591947555542},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.608587920665741},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5659897327423096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5495400428771973},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5303417444229126},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4596765339374542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38444283604621887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3700355291366577},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3354005813598633},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05426490306854248}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9579468965530396},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8524843454360962},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6747055649757385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6448591947555542},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.608587920665741},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5659897327423096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5495400428771973},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5303417444229126},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4596765339374542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38444283604621887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3700355291366577},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3354005813598633},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05426490306854248},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2013.6719893","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing &amp; Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W844631126","https://openalex.org/W1553457221","https://openalex.org/W1973004385","https://openalex.org/W1975130490","https://openalex.org/W1981936740","https://openalex.org/W1987255189","https://openalex.org/W1997625337","https://openalex.org/W2006358835","https://openalex.org/W2011334426","https://openalex.org/W2018028283","https://openalex.org/W2019682546","https://openalex.org/W2021823347","https://openalex.org/W2054812791","https://openalex.org/W2057974816","https://openalex.org/W2090069860","https://openalex.org/W2095150268","https://openalex.org/W2101657530","https://openalex.org/W2104670598","https://openalex.org/W2113526966","https://openalex.org/W2118371226","https://openalex.org/W2126371318","https://openalex.org/W2161087400","https://openalex.org/W4229675399","https://openalex.org/W4246411990","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W1987877777","https://openalex.org/W2370323645","https://openalex.org/W4247343174","https://openalex.org/W2168643831","https://openalex.org/W2089884908","https://openalex.org/W2794855054","https://openalex.org/W2052469048","https://openalex.org/W2081475278","https://openalex.org/W4321504838","https://openalex.org/W2314520391"],"abstract_inverted_index":{"The":[0,47],"classical":[1],"F2\u2225\u03a3T":[2],"<sub":[3],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[4],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">j</sub>":[5],"problem":[6],"is":[7,34],"considered.":[8],"A":[9],"Tabu":[10,54],"search":[11,55],"and":[12,21,66],"a":[13,22,27],"matheuristic":[14,65],"algorithm":[15],"are":[16],"proposed":[17],"as":[18],"upper":[19],"bounds":[20],"lower":[23,69],"bound":[24],"based":[25],"on":[26,43],"partial":[28],"relaxation":[29],"of":[30,52,63,67],"the":[31,50,53,60,64,68],"MILP":[32],"model":[33],"proposed.":[35],"All":[36],"these":[37],"methods":[38],"have":[39],"been":[40],"extensively":[41],"tested":[42],"randomly":[44],"generated":[45],"instances.":[46],"results":[48],"show":[49,59],"performances":[51,62],"algorithm.":[56],"They":[57],"also":[58],"good":[61],"bound,":[70],"preferably":[71],"for":[72],"small":[73],"instances":[74],"(up":[75],"to":[76],"100":[77],"jobs).":[78]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}