{"id":"https://openalex.org/W1222945658","doi":"https://doi.org/10.1023/a:1027372722187","title":"The Flow Shop Scheduling Polyhedron with Setup Times","display_name":"The Flow Shop Scheduling Polyhedron with Setup Times","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W1222945658","doi":"https://doi.org/10.1023/a:1027372722187","mag":"1222945658"},"language":"en","primary_location":{"id":"doi:10.1023/a:1027372722187","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1027372722187","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/A5070453467","display_name":"Roger Z. R\u00edos\u2010Mercado","orcid":"https://orcid.org/0000-0003-1053-5183"},"institutions":[{"id":"https://openalex.org/I169046204","display_name":"Universidad Aut\u00f3noma de Nuevo Le\u00f3n","ror":"https://ror.org/01fh86n78","country_code":"MX","type":"education","lineage":["https://openalex.org/I169046204"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Roger Z. R\u00edos-Mercado","raw_affiliation_strings":["Graduate Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, AP 111\u2014F, Cd. Universitaria, San Nicol\u00e1s de los Garza, NL, 66450, M\u00e9xico","Graduate Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, AP 111\u2014F, Cd. Universitaria, San Nicol\u00e1s de los Garza, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, AP 111\u2014F, Cd. Universitaria, San Nicol\u00e1s de los Garza, NL, 66450, M\u00e9xico","institution_ids":["https://openalex.org/I169046204"]},{"raw_affiliation_string":"Graduate Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, AP 111\u2014F, Cd. Universitaria, San Nicol\u00e1s de los Garza, M\u00e9xico","institution_ids":["https://openalex.org/I169046204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020565600","display_name":"Jonathan F. Bard","orcid":"https://orcid.org/0000-0001-8569-0909"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan F. Bard","raw_affiliation_strings":["Graduate Program in Operations Research, University of Texas at Austin, Austin, TX, 78712\u20131063, USA","Graduate Program in Operations Research, University of Texas at Austin, Austin, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate Program in Operations Research, University of Texas at Austin, Austin, TX, 78712\u20131063, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Graduate Program in Operations Research, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.5513,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.82232459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"3","first_page":"291","last_page":"318"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9937000274658203,"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.98580002784729,"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/polytope","display_name":"Polytope","score":0.8278387784957886},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7820247411727905},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7672025561332703},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.694600522518158},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6553965210914612},{"id":"https://openalex.org/keywords/polyhedral-combinatorics","display_name":"Polyhedral combinatorics","score":0.6226966381072998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6045302152633667},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5701988339424133},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5638965368270874},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5494685173034668},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5268829464912415},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4991426467895508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4489533007144928},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.44593971967697144},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4331437051296234},{"id":"https://openalex.org/keywords/facet","display_name":"Facet (psychology)","score":0.41465532779693604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34482622146606445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2040528953075409},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.12920603156089783},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.12646538019180298}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8278387784957886},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7820247411727905},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7672025561332703},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.694600522518158},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6553965210914612},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.6226966381072998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6045302152633667},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5701988339424133},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5638965368270874},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5494685173034668},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5268829464912415},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4991426467895508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4489533007144928},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44593971967697144},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4331437051296234},{"id":"https://openalex.org/C43122875","wikidata":"https://www.wikidata.org/wiki/Q5428522","display_name":"Facet (psychology)","level":4,"score":0.41465532779693604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34482622146606445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2040528953075409},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.12920603156089783},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.12646538019180298},{"id":"https://openalex.org/C187288502","wikidata":"https://www.wikidata.org/wiki/Q641118","display_name":"Personality","level":2,"score":0.0},{"id":"https://openalex.org/C2865642","wikidata":"https://www.wikidata.org/wiki/Q378132","display_name":"Big Five personality traits","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1023/a:1027372722187","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1027372722187","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:7:y:2003:i:3:d:10.1023_a:1027372722187","is_oa":false,"landing_page_url":"http://link.springer.com/10.1023/A:1027372722187","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308138","display_name":"Texas Higher Education Coordinating Board","ror":"https://ror.org/05as1qb59"},{"id":"https://openalex.org/F4320310620","display_name":"University of Texas at Austin","ror":"https://ror.org/00hj54h04"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1525607884","https://openalex.org/W1546279261","https://openalex.org/W1965363974","https://openalex.org/W1968143987","https://openalex.org/W1971772321","https://openalex.org/W1978038344","https://openalex.org/W1984809851","https://openalex.org/W1993788738","https://openalex.org/W1999879286","https://openalex.org/W2005263984","https://openalex.org/W2006228799","https://openalex.org/W2014265988","https://openalex.org/W2020898729","https://openalex.org/W2023721044","https://openalex.org/W2030815566","https://openalex.org/W2054965643","https://openalex.org/W2060693768","https://openalex.org/W2062419055","https://openalex.org/W2075030161","https://openalex.org/W2082514776","https://openalex.org/W2090902243","https://openalex.org/W2122967269","https://openalex.org/W2324108981","https://openalex.org/W2505968561","https://openalex.org/W2808512824"],"related_works":["https://openalex.org/W1222945658","https://openalex.org/W2109816236","https://openalex.org/W2026045445","https://openalex.org/W1505865794","https://openalex.org/W3123030457","https://openalex.org/W2115718900","https://openalex.org/W4285583151","https://openalex.org/W2803772358","https://openalex.org/W2063375015","https://openalex.org/W2028630186"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}