{"id":"https://openalex.org/W2293616868","doi":"https://doi.org/10.1007/s10951-017-0550-0","title":"Scheduling meets n-fold integer programming","display_name":"Scheduling meets n-fold integer programming","publication_year":2017,"publication_date":"2017-11-15","ids":{"openalex":"https://openalex.org/W2293616868","doi":"https://doi.org/10.1007/s10951-017-0550-0","mag":"2293616868"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-017-0550-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-017-0550-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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 Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1603.02611","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Department of Applied Mathematics (KAM), Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-2588-5709","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics (KAM), Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":null,"display_name":"Martin Kouteck\u00fd","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Kouteck\u00fd","raw_affiliation_strings":["Department of Applied Mathematics (KAM), Charles University, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics (KAM), Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":4.3249,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.94136992,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"21","issue":"5","first_page":"493","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.5088000297546387,"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.5088000297546387,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.15209999680519104,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.06729999929666519,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.6984000205993652},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6323999762535095},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6115999817848206},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5253000259399414},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.46459999680519104},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43860000371932983},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.37049999833106995},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.36070001125335693},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.3221000134944916}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6984000205993652},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6682999730110168},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6323999762535095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6230000257492065},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5253000259399414},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.46459999680519104},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43860000371932983},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.37049999833106995},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.36070001125335693},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.3116999864578247},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.28049999475479126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2802000045776367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2709999978542328},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.2705000042915344},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C35799125","wikidata":"https://www.wikidata.org/wiki/Q7095711","display_name":"Open-shop scheduling","level":5,"score":0.2590999901294708},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25270000100135803},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10951-017-0550-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-017-0550-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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 Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1603.02611","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.02611","pdf_url":"https://arxiv.org/pdf/1603.02611","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:RePEc:spr:jsched:v:21:y:2018:i:5:d:10.1007_s10951-017-0550-0","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10951-017-0550-0","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":{"id":"pmh:oai:arXiv.org:1603.02611","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.02611","pdf_url":"https://arxiv.org/pdf/1603.02611","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1859893626","display_name":null,"funder_award_id":"1784214","funder_id":"https://openalex.org/F4320309872","funder_display_name":"Grantov\u00e1 Agentura, Univerzita Karlova"},{"id":"https://openalex.org/G3099319656","display_name":null,"funder_award_id":"SVV-2017-260452","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G5123061341","display_name":null,"funder_award_id":"338216","funder_id":"https://openalex.org/F4320309872","funder_display_name":"Grantov\u00e1 Agentura, Univerzita Karlova"}],"funders":[{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320309872","display_name":"Grantov\u00e1 Agentura, Univerzita Karlova","ror":"https://ror.org/024d6js02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W23064316","https://openalex.org/W653291882","https://openalex.org/W964861289","https://openalex.org/W1513894211","https://openalex.org/W1555903671","https://openalex.org/W1779426617","https://openalex.org/W1904897678","https://openalex.org/W1980809300","https://openalex.org/W1987322775","https://openalex.org/W2029604753","https://openalex.org/W2031612682","https://openalex.org/W2034689708","https://openalex.org/W2035177751","https://openalex.org/W2047105695","https://openalex.org/W2053352956","https://openalex.org/W2063525042","https://openalex.org/W2087411299","https://openalex.org/W2106164341","https://openalex.org/W2111874279","https://openalex.org/W2114616381","https://openalex.org/W2116087731","https://openalex.org/W2119344260","https://openalex.org/W2146219471","https://openalex.org/W2151677066","https://openalex.org/W2152514082","https://openalex.org/W2158544809","https://openalex.org/W2168633992","https://openalex.org/W2255606401","https://openalex.org/W2288973395","https://openalex.org/W2604774552","https://openalex.org/W2962877422","https://openalex.org/W2964307467","https://openalex.org/W3089811425"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}