{"id":"https://openalex.org/W7225396232","doi":"https://doi.org/10.1007/s00453-026-01414-3","title":"Single Machine Scheduling with Few Deadlines","display_name":"Single Machine Scheduling with Few Deadlines","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225396232","doi":"https://doi.org/10.1007/s00453-026-01414-3"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-026-01414-3","doi":"https://doi.org/10.1007/s00453-026-01414-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01414-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s00453-026-01414-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074163053","display_name":"Klaus Heeger","orcid":"https://orcid.org/0000-0001-8779-0890","observed_orcids":["https://orcid.org/0000-0001-8779-0890"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Klaus Heeger","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","Fraunhofer IOSB-INA, Lemgo, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Fraunhofer IOSB-INA, Lemgo, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052950579","display_name":"Danny Hermelin","orcid":"https://orcid.org/0000-0002-6379-0383","observed_orcids":["https://orcid.org/0000-0002-6379-0383"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Danny Hermelin","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032224171","display_name":"Dvir Shabtay","orcid":"https://orcid.org/0000-0002-2709-599X","observed_orcids":["https://orcid.org/0000-0002-2709-599X"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Dvir Shabtay","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032224171","https://openalex.org/A5052950579","https://openalex.org/A5074163053"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"89","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9785000085830688,"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.9785000085830688,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.006800000090152025,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.002400000113993883,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"single machine scheduling","score":0.8980000019073486},{"id":"https://openalex.org/keywords/deadlines","display_name":"deadlines","score":0.7120000123977661},{"id":"https://openalex.org/keywords/weighted-number-of-tardy-jobs","display_name":"weighted number of tardy jobs","score":0.9480000138282776},{"id":"https://openalex.org/keywords/total-weighted-completion-time","display_name":"total weighted completion time","score":0.9750000238418579},{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","score":0.9330000281333923},{"id":"https://openalex.org/keywords/eth-lower-bounds","display_name":"ETH lower bounds","score":0.9139999747276306},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.972000002861023},{"id":"https://openalex.org/keywords/w-1-hardness","display_name":"W[1]-hardness","score":0.972000002861023},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.8429999947547913}],"concepts":[{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.7207000255584717},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7099999785423279},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6746000051498413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.560699999332428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5497000217437744},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5033000111579895},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45570001006126404},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.420199990272522},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4027000069618225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3984000086784363},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.3303000032901764},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.31619998812675476},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C9490382","wikidata":"https://www.wikidata.org/wiki/Q729113","display_name":"Weighted arithmetic mean","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-026-01414-3","doi":"https://doi.org/10.1007/s00453-026-01414-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01414-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-026-01414-3","doi":"https://doi.org/10.1007/s00453-026-01414-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01414-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320336060","display_name":"Bundesministerium f\u00fcr Umwelt, Naturschutz, nukleare Sicherheit und Verbraucherschutz","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W143838926","https://openalex.org/W230140535","https://openalex.org/W1488422606","https://openalex.org/W1988328380","https://openalex.org/W2000672358","https://openalex.org/W2010484711","https://openalex.org/W2028602007","https://openalex.org/W2038017970","https://openalex.org/W2059428776","https://openalex.org/W2063525042","https://openalex.org/W2065269629","https://openalex.org/W2066620795","https://openalex.org/W2067297441","https://openalex.org/W2104178995","https://openalex.org/W2107216979","https://openalex.org/W2127397667","https://openalex.org/W2146696160","https://openalex.org/W2341012368","https://openalex.org/W2341350247","https://openalex.org/W2743045177","https://openalex.org/W2963195111","https://openalex.org/W2977092953","https://openalex.org/W3148746615","https://openalex.org/W3184499797","https://openalex.org/W4211237573","https://openalex.org/W4313136739","https://openalex.org/W4404318301","https://openalex.org/W4407260970"],"related_works":["https://openalex.org/W2755811056","https://openalex.org/W4414246592","https://openalex.org/W2157859449","https://openalex.org/W4402699359","https://openalex.org/W2977092953","https://openalex.org/W2399328427","https://openalex.org/W2021945696","https://openalex.org/W4390602379","https://openalex.org/W4389746870","https://openalex.org/W2093528244"],"abstract_inverted_index":{"Abstract":[0],"We":[1,9],"study":[2,64],"single-machine":[3],"scheduling":[4],"problems":[5,102],"with":[6,56,73,78],"few":[7],"deadlines.":[8,51],"focus":[10],"on":[11],"three":[12,38,101],"classical":[13],"objectives,":[14],"namely":[15],"minimizing":[16,112,122],"the":[17,23,29,37,65,69,82,97,105,113,123],"weighted":[18,25,31,106,115,125],"number":[19,48,70,107],"of":[20,36,49,71,86,99,108],"tardy":[21,109],"jobs,":[22],"total":[24,30,83,114,124],"completion":[26,126],"time,":[27],"and":[28,111],"late":[32,116],"work.":[33],"For":[34,94],"each":[35],"problems,":[39],"we":[40,63],"give":[41],"a":[42,46,92],"pseudo-polynomial-time":[43],"algorithm":[44],"for":[45],"constant":[47],"different":[50],"These":[52],"algorithms":[53],"are":[54],"complemented":[55],"ETH-based,":[57],"almost":[58],"tight":[59],"lower":[60],"bounds.":[61],"Furthermore,":[62],"case":[66],"in":[67],"which":[68],"jobs":[72,77,110],"nontrivial":[74],"deadline":[75,79],"(i.e.":[76],"smaller":[80],"than":[81],"processing":[84],"time":[85,127],"all":[87],"jobs)":[88],"is":[89,128],"taken":[90],"as":[91],"parameter.":[93],"this":[95],"case,":[96],"complexities":[98],"our":[100],"differ:":[103],"Minimizing":[104],"work":[117],"becomes":[118],"fixed-parameter":[119],"tractable,":[120],"while":[121],"W[1]-hard.":[129]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-07T00:00:00"}