{"id":"https://openalex.org/W2160962818","doi":"https://doi.org/10.1007/s10878-013-9670-4","title":"A combination of flow shop scheduling and the shortest path problem","display_name":"A combination of flow shop scheduling and the shortest path problem","publication_year":2013,"publication_date":"2013-10-28","ids":{"openalex":"https://openalex.org/W2160962818","doi":"https://doi.org/10.1007/s10878-013-9670-4","mag":"2160962818"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-013-9670-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9670-4","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","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/A5089633440","display_name":"Kameng Nip","orcid":"https://orcid.org/0000-0002-8597-3295"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Kameng Nip","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100628477","display_name":"Zhenbo Wang","orcid":"https://orcid.org/0000-0003-1359-4621"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenbo Wang","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016721263","display_name":"Fabrice Talla Nobibon","orcid":null},"institutions":[{"id":"https://openalex.org/I2802067006","display_name":"Research Foundation - Flanders","ror":"https://ror.org/03qtxy027","country_code":"BE","type":"government","lineage":["https://openalex.org/I2802067006"]},{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Fabrice Talla Nobibon","raw_affiliation_strings":["Research Foundation\u2013Flanders, ORSTAT, Faculty of Economics and Business, KU Leuven, Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"Research Foundation\u2013Flanders, ORSTAT, Faculty of Economics and Business, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I2802067006","https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039812522","display_name":"Roel Leus","orcid":"https://orcid.org/0000-0002-9215-3914"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Roel Leus","raw_affiliation_strings":["ORSTAT, Faculty of Economics and Business, KU Leuven, Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"ORSTAT, Faculty of Economics and Business, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5089633440"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.4853,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.92548507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"1","first_page":"36","last_page":"52"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9947999715805054,"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.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7596651315689087},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.757713794708252},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6839717626571655},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6571018695831299},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.64264976978302},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6311916708946228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5613489151000977},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49166256189346313},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43362683057785034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38880476355552673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2631165385246277},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19025960564613342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17237624526023865},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08115005493164062}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7596651315689087},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.757713794708252},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6839717626571655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6571018695831299},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.64264976978302},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6311916708946228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5613489151000977},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49166256189346313},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43362683057785034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38880476355552673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2631165385246277},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19025960564613342},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17237624526023865},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08115005493164062},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-013-9670-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9670-4","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-013-9670-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-013-9670-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/420047","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/420047/2/10.1007_s10878-013-9670-4.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, vol. 29 (1), (36-52)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1548540712","https://openalex.org/W1963888335","https://openalex.org/W1967955864","https://openalex.org/W1977545325","https://openalex.org/W2004102446","https://openalex.org/W2011039300","https://openalex.org/W2024085737","https://openalex.org/W2035754921","https://openalex.org/W2066047491","https://openalex.org/W2075846649","https://openalex.org/W2112504072","https://openalex.org/W2124833419","https://openalex.org/W2157846217","https://openalex.org/W2169528473","https://openalex.org/W2476096155","https://openalex.org/W2586270237","https://openalex.org/W4253347690","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
