{"id":"https://openalex.org/W2556746962","doi":"https://doi.org/10.1109/coase.2016.7743493","title":"A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem","display_name":"A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2556746962","doi":"https://doi.org/10.1109/coase.2016.7743493","mag":"2556746962"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2016.7743493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5086717490","display_name":"Marcus Ritt","orcid":"https://orcid.org/0000-0001-7894-1634"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Marcus Ritt","raw_affiliation_strings":["Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Brazil","institution_ids":["https://openalex.org/I130442723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086717490"],"corresponding_institution_ids":["https://openalex.org/I130442723"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"872","last_page":"877"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6321648359298706},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6248798370361328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6219295859336853},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6122480630874634},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6078043580055237},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5391185283660889},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5336818099021912},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5304421782493591},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4931158721446991},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.45542967319488525},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44180402159690857},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.43915697932243347},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.43039727210998535},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41286811232566833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29405975341796875},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.27963656187057495},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.11504966020584106}],"concepts":[{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6321648359298706},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6248798370361328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6219295859336853},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6122480630874634},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6078043580055237},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5391185283660889},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5336818099021912},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5304421782493591},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4931158721446991},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.45542967319488525},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44180402159690857},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.43915697932243347},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43039727210998535},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41286811232566833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29405975341796875},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.27963656187057495},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.11504966020584106},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2016.7743493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W250249669","https://openalex.org/W331797721","https://openalex.org/W1488422606","https://openalex.org/W1504954800","https://openalex.org/W1843322475","https://openalex.org/W1969186119","https://openalex.org/W1970320473","https://openalex.org/W1974746930","https://openalex.org/W1996926743","https://openalex.org/W1999339786","https://openalex.org/W1999602996","https://openalex.org/W2004512235","https://openalex.org/W2006751452","https://openalex.org/W2011039300","https://openalex.org/W2012238981","https://openalex.org/W2021735328","https://openalex.org/W2023170315","https://openalex.org/W2024085737","https://openalex.org/W2036480243","https://openalex.org/W2038757212","https://openalex.org/W2049813155","https://openalex.org/W2053973567","https://openalex.org/W2073922730","https://openalex.org/W2087411299","https://openalex.org/W2088851523","https://openalex.org/W2090069860","https://openalex.org/W2091364465","https://openalex.org/W2111060121","https://openalex.org/W2156391157","https://openalex.org/W2277678953","https://openalex.org/W2553119840","https://openalex.org/W2612169040","https://openalex.org/W4240374930","https://openalex.org/W6630144005","https://openalex.org/W6730092772","https://openalex.org/W6945839758"],"related_works":["https://openalex.org/W2473338386","https://openalex.org/W2971620318","https://openalex.org/W2129998174","https://openalex.org/W2768622058","https://openalex.org/W1636774009","https://openalex.org/W4211243022","https://openalex.org/W3180740316","https://openalex.org/W2376570066","https://openalex.org/W3098335909","https://openalex.org/W1502125971"],"abstract_inverted_index":{"The":[0,30],"permutation":[1],"flow":[2],"shop":[3],"scheduling":[4,13],"problem":[5],"is":[6,85],"one":[7],"of":[8,70,91],"the":[9,56,68,71,76,92],"fundamental":[10],"problems":[11],"in":[12],"with":[14,50],"many":[15],"practical":[16],"applications.":[17],"In":[18,63],"this":[19],"paper,":[20],"we":[21,66],"propose":[22],"a":[23,40,46],"branch-and-bound":[24],"algorithm":[25,31],"for":[26],"solving":[27],"it":[28],"exactly.":[29],"uses":[32],"an":[33],"iterated":[34],"local":[35],"search":[36,49,74],"to":[37,54,87],"quickly":[38],"find":[39,55],"good":[41],"initial":[42],"solution,":[43],"followed":[44],"by":[45],"cyclic":[47,72],"best-first":[48,73],"dynamic":[51,77],"bi-directional":[52],"branching":[53,78],"optimal":[57],"solution":[58],"and":[59,75,80],"prove":[60],"its":[61],"optimality.":[62],"computational":[64],"experiments":[65],"analyze":[67],"effects":[69],"strategy,":[79],"show":[81],"that":[82],"our":[83],"approach":[84],"able":[86],"combine":[88],"preferable":[89],"characteristics":[90],"current":[93],"best":[94],"exact":[95],"algorithms.":[96]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}