{"id":"https://openalex.org/W1999832757","doi":"https://doi.org/10.1007/s10878-005-1414-7","title":"A Framework for the Complexity of High-Multiplicity Scheduling Problems","display_name":"A Framework for the Complexity of High-Multiplicity Scheduling Problems","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W1999832757","doi":"https://doi.org/10.1007/s10878-005-1414-7","mag":"1999832757"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-005-1414-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1414-7","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":true,"oa_status":"green","oa_url":"https://orbi.uliege.be/handle/2268/1721","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051164757","display_name":"Nadia Brauner","orcid":"https://orcid.org/0000-0002-2890-4509"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"N. Brauner","raw_affiliation_strings":["Laboratoire Leibniz-IMAG, 46 avenue F\u2019elix Viallet, 38031, Grenoble cedex, France","Laboratoire Leibniz-IMAG, Grenoble cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire Leibniz-IMAG, 46 avenue F\u2019elix Viallet, 38031, Grenoble cedex, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Leibniz-IMAG, Grenoble cedex, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038958909","display_name":"Yves Crama","orcid":"https://orcid.org/0000-0002-7470-4743"},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Y. Crama","raw_affiliation_strings":["HEC Management School, University of Li\u00e8ge, Boulevard du Rectorat 7 (B31), 4000, Li\u00e8ge, Belgium","HEC Management School, University of Li\u00e8ge, Li\u00e8ge, Belgium#TAB#"],"affiliations":[{"raw_affiliation_string":"HEC Management School, University of Li\u00e8ge, Boulevard du Rectorat 7 (B31), 4000, Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]},{"raw_affiliation_string":"HEC Management School, University of Li\u00e8ge, Li\u00e8ge, Belgium#TAB#","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052039079","display_name":"Alexander Grigoriev","orcid":"https://orcid.org/0000-0002-8391-235X"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. Grigoriev","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086072148","display_name":"Joris van de Klundert","orcid":"https://orcid.org/0000-0003-4151-5089"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"J. van de Klundert","raw_affiliation_strings":["Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands","Department of Mathematics, Maastricht University, Maastricht, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Mathematics, Maastricht University, Maastricht, The Netherlands#TAB#","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051164757"],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":6.8938,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96117146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"3","first_page":"313","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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.9840999841690063,"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/theory-of-computation","display_name":"Theory of computation","score":0.7374828457832336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6636099815368652},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6012515425682068},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.5737784504890442},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4444456100463867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28650543093681335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.263705313205719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2551244795322418}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7374828457832336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6636099815368652},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6012515425682068},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.5737784504890442},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4444456100463867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28650543093681335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.263705313205719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2551244795322418},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s10878-005-1414-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1414-7","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:cris.maastrichtuniversity.nl:openaire_cris_publications/5dddc6e4-163d-49e2-969b-1793c76fb5ad","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/5dddc6e4-163d-49e2-969b-1793c76fb5ad","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brauner, N, Crama, Y, Grigoriev, A & van de Klundert, J 2005, 'A Framework for the complexity of high multiplicity scheduling problems', Journal of Combinatorial Optimization, vol. 9, no. 3, pp. 313-323. https://doi.org/10.1007/s10878-005-1414-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.898.2868","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.898.2868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://digitalarchive.maastrichtuniversity.nl/fedora/get/guid%3Af22b0a55-7166-43d8-95b5-04a789097ad0/ASSET1/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00356015v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00356015","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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, 2005, 9, pp.313-323. ⟨10.1007/s10878-005-1414-7⟩","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:spr:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1414-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-005-1414-7","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:orbi.ulg.ac.be:2268/1721","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/1721","pdf_url":null,"source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 9 (3), 313-323 (2005-05)","raw_type":"peer reviewed"}],"best_oa_location":{"id":"pmh:oai:orbi.ulg.ac.be:2268/1721","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/1721","pdf_url":null,"source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 9 (3), 313-323 (2005-05)","raw_type":"peer reviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1485398007","https://openalex.org/W1499144293","https://openalex.org/W1529616834","https://openalex.org/W1975401191","https://openalex.org/W1975678202","https://openalex.org/W1981393561","https://openalex.org/W1986189899","https://openalex.org/W1988684291","https://openalex.org/W1991287453","https://openalex.org/W2007535918","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2036194085","https://openalex.org/W2042706779","https://openalex.org/W2053913299","https://openalex.org/W2064777332","https://openalex.org/W2065889460","https://openalex.org/W2069323107","https://openalex.org/W2086091870","https://openalex.org/W2093776691","https://openalex.org/W2096318933","https://openalex.org/W2098734690","https://openalex.org/W2099796355","https://openalex.org/W2107481047","https://openalex.org/W2122967269","https://openalex.org/W2162870855","https://openalex.org/W2172206141","https://openalex.org/W3122890684","https://openalex.org/W4285719527","https://openalex.org/W6631601511"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4230581126","https://openalex.org/W4378765297","https://openalex.org/W2390279801","https://openalex.org/W2761548024","https://openalex.org/W2358668433","https://openalex.org/W2016521071","https://openalex.org/W2069384021","https://openalex.org/W2001367988","https://openalex.org/W1990308498"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}