{"id":"https://openalex.org/W4285010250","doi":"https://doi.org/10.1145/3490148.3538579","title":"Permutation Predictions for Non-Clairvoyant Scheduling","display_name":"Permutation Predictions for Non-Clairvoyant Scheduling","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285010250","doi":"https://doi.org/10.1145/3490148.3538579"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://media.suub.uni-bremen.de/bitstream/elib/8154/3/Lindermayr_Megow_Permutation%20Predictions%20for%20Non-Clairvoyant%20Scheduling_2022_accepted-version.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064520982","display_name":"Alexander Lindermayr","orcid":"https://orcid.org/0000-0001-6714-5034"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexander Lindermayr","raw_affiliation_strings":["University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073490534","display_name":"Nicole Megow","orcid":"https://orcid.org/0000-0002-3531-7644"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064520982"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":1.8648,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86226081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7523210048675537},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7011610269546509},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6243668794631958},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6148733496665955},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5075927972793579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39111611247062683},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.385397732257843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3783797025680542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31188350915908813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14517155289649963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7523210048675537},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7011610269546509},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6243668794631958},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6148733496665955},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5075927972793579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39111611247062683},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.385397732257843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3783797025680542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31188350915908813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14517155289649963},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3490148.3538579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:media.suub.uni-bremen.de:Publications/elib/8154","is_oa":true,"landing_page_url":"https://media.suub.uni-bremen.de/handle/elib/8154","pdf_url":"https://media.suub.uni-bremen.de/bitstream/elib/8154/3/Lindermayr_Megow_Permutation%20Predictions%20for%20Non-Clairvoyant%20Scheduling_2022_accepted-version.pdf","source":{"id":"https://openalex.org/S4306402486","display_name":"Media (https://www.suub.uni-bremen.de/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180437899","host_organization_name":"University of Bremen","host_organization_lineage":["https://openalex.org/I180437899"],"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":"","raw_type":"Artikel/Aufsatz"},{"id":"doi:10.26092/elib/3188","is_oa":true,"landing_page_url":"https://doi.org/10.26092/elib/3188","pdf_url":null,"source":{"id":"https://openalex.org/S7407052977","display_name":"Staats- und Universit\u00e4tsbibliothek Bremen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:media.suub.uni-bremen.de:Publications/elib/8154","is_oa":true,"landing_page_url":"https://media.suub.uni-bremen.de/handle/elib/8154","pdf_url":"https://media.suub.uni-bremen.de/bitstream/elib/8154/3/Lindermayr_Megow_Permutation%20Predictions%20for%20Non-Clairvoyant%20Scheduling_2022_accepted-version.pdf","source":{"id":"https://openalex.org/S4306402486","display_name":"Media (https://www.suub.uni-bremen.de/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180437899","host_organization_name":"University of Bremen","host_organization_lineage":["https://openalex.org/I180437899"],"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":"","raw_type":"Artikel/Aufsatz"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G4995517311","display_name":null,"funder_award_id":"146371743 - TRR 89 Invasive Computing","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G554679937","display_name":null,"funder_award_id":"146371743","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6283469581","display_name":null,"funder_award_id":"ME 3825/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7265854623","display_name":null,"funder_award_id":"TRR 89","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4285010250.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W195867136","https://openalex.org/W607505555","https://openalex.org/W1492033508","https://openalex.org/W1964085249","https://openalex.org/W1964506478","https://openalex.org/W1988328380","https://openalex.org/W2076551060","https://openalex.org/W2077348732","https://openalex.org/W2110703709","https://openalex.org/W2118328307","https://openalex.org/W2138543759","https://openalex.org/W2772039599","https://openalex.org/W2784121118","https://openalex.org/W2912168264","https://openalex.org/W2986547560","https://openalex.org/W2997214873","https://openalex.org/W3167808560","https://openalex.org/W3170257365","https://openalex.org/W4226071809","https://openalex.org/W4235684105","https://openalex.org/W4286972792","https://openalex.org/W4287595761","https://openalex.org/W4288088781"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W4388311650","https://openalex.org/W5922282","https://openalex.org/W1974056099","https://openalex.org/W4245343541","https://openalex.org/W2386077341","https://openalex.org/W563589758","https://openalex.org/W62490179","https://openalex.org/W3204654320"],"abstract_inverted_index":{"In":[0],"non-clairvoyant":[1],"scheduling,":[2],"the":[3,21,25,82,118,123,133,149,156],"task":[4],"is":[5],"to":[6,23,155],"find":[7],"an":[8],"online":[9,46],"strategy":[10],"for":[11,138],"scheduling":[12,136],"jobs":[13,69,140],"with":[14,20,102],"a":[15,36,59,65,94],"priori":[16],"unknown":[17,83],"processing":[18,55],"requirements":[19],"objective":[22],"minimize":[24],"total":[26],"(weighted)":[27],"completion":[28],"time.":[29],"We":[30,85,116,144],"revisit":[31],"this":[32],"well-studied":[33],"problem":[34],"in":[35,45,111,122,146],"recently":[37],"popular":[38],"learning-augmented":[39,135],"setting":[40],"that":[41,87,107],"integrates":[42],"(untrusted)":[43],"predictions":[44,53,89],"algorithm":[47],"design.":[48],"While":[49],"previous":[50],"works":[51],"used":[52],"on":[54],"requirements,":[56],"we":[57],"propose":[58],"new":[60],"prediction":[61],"model,":[62],"which":[63,70],"provides":[64],"relative":[66],"order":[67],"of":[68,81],"could":[71],"be":[72],"seen":[73],"as":[74,98,100],"predicting":[75],"algorithmic":[76,119],"actions":[77],"rather":[78],"than":[79],"parts":[80],"input.":[84],"show":[86],"these":[88],"have":[90],"desired":[91],"properties,":[92],"admit":[93],"natural":[95],"error":[96],"measure":[97],"well":[99],"algorithms":[101],"strong":[103],"performance":[104,153],"guarantees":[105],"and":[106,114,131,141,151],"they":[108],"are":[109],"learnable":[110],"both,":[112],"theory":[113],"practice.":[115],"generalize":[117],"framework":[120],"proposed":[121],"seminal":[124],"paper":[125],"by":[126],"Kumar":[127],"et":[128],"al.":[129],"(NeurIPS'18)":[130],"present":[132],"first":[134],"results":[137],"weighted":[139],"unrelated":[142],"machines.":[143],"demonstrate":[145],"empirical":[147],"experiments":[148],"practicability":[150],"superior":[152],"compared":[154],"previously":[157],"suggested":[158],"single-machine":[159],"algorithms.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4}],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2025-10-10T00:00:00"}