{"id":"https://openalex.org/W7154995408","doi":"https://doi.org/10.48550/arxiv.2604.16030","title":"Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants","display_name":"Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7154995408","doi":"https://doi.org/10.48550/arxiv.2604.16030"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16030","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16030","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.16030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092231004","display_name":"Sotiris Kanellopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanellopoulos, Sotiris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053190888","display_name":"Giorgos Mitropoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitropoulos, Giorgos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119981656","display_name":"Christos Pergaminelis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pergaminelis, Christos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5117111324","display_name":"Thanos Tolias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tolias, Thanos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.5015000104904175,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.5015000104904175,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.11180000007152557,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.07569999992847443,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.652999997138977},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48669999837875366},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4814000129699707},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.39739999175071716},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3662000000476837},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.29440000653266907}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.652999997138977},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48669999837875366},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4814000129699707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4657000005245209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4140999913215637},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3662000000476837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35830000042915344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3260999917984009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16030","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16030","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.16030","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16030","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"k-Visits":[1,211],"problem":[2,24,142],"is":[3,58,69,100,109],"a":[4,29,138,193],"recently":[5],"introduced":[6],"finite":[7],"version":[8,139],"of":[9,20,31,48,66,87,106,121,126,140,160,177,183,202,210],"Pinwheel":[10,184],"Scheduling":[11,185],"[Kanellopoulos":[12,78],"et":[13,79],"al.,":[14,80],"SODA":[15,81],"2026].":[16],"Given":[17],"the":[18,23,63,67,85,93,104,119,124,141,174,181,199,207],"deadlines":[19,108],"n":[21],"tasks,":[22],"asks":[25],"whether":[26],"there":[27],"exists":[28],"schedule":[30],"length":[32],"kn":[33],"executing":[34],"each":[35,49],"task":[36],"exactly":[37],"k":[38],"times,":[39],"with":[40],"no":[41],"deadline":[42],"expiring":[43],"between":[44],"consecutive":[45],"visits":[46],"(executions)":[47],"task.":[50],"In":[51],"this":[52],"work":[53],"we":[54,96,170,191],"prove":[55,97,205],"that":[56,98,158,206],"2-Visits":[57,88,99,122,136,203],"strongly":[59],"NP-complete":[60],"even":[61],"when":[62,103],"maximum":[64],"multiplicity":[65],"input":[68],"equal":[70],"to":[71,137,165,167,180],"2,":[72],"settling":[73],"an":[74],"open":[75,116],"question":[76,117],"from":[77],"2026]":[82],"and":[83,150,204],"contrasting":[84],"tractability":[86],"for":[89,135,173,198,215],"simple":[90],"sets.":[91],"On":[92],"other":[94,152],"hand,":[95],"in":[101,189],"RP":[102],"number":[105,125],"distinct":[107],"constant,":[110],"thus":[111],"making":[112],"progress":[113],"on":[114],"another":[115],"regarding":[118],"parameterization":[120],"by":[123],"numbers.":[127],"We":[128],"then":[129],"generalize":[130],"all":[131],"existing":[132],"positive":[133],"results":[134,162],"where":[143],"some":[144,151,159],"tasks":[145,153],"must":[146],"be":[147],"visited":[148],"once":[149],"twice,":[154],"while":[155],"providing":[156],"evidence":[157],"these":[161],"are":[163],"unlikely":[164],"transfer":[166],"3-Visits.":[168],"Lastly,":[169],"establish":[171],"bounds":[172],"density":[175,200,208],"thresholds":[176],"k-Visits,":[178],"analogous":[179],"$(5/6)$-threshold":[182],"[Kawamura,":[186],"STOC":[187],"2024];":[188],"particular,":[190],"show":[192],"$\\sqrt{2}-1/2\\approx":[194],"0.9142$":[195],"lower":[196],"bound":[197],"threshold":[201,209],"approaches":[212],"$5/6\\approx":[213],"0.8333$":[214],"$k":[216],"\\to":[217],"\\infty$.":[218]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-21T00:00:00"}