{"id":"https://openalex.org/W7110420506","doi":"https://doi.org/10.4230/lipics.esa.2025.27","title":"Online Makespan Scheduling Under Scenarios","display_name":"Online Makespan Scheduling Under Scenarios","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110420506","doi":"https://doi.org/10.4230/lipics.esa.2025.27"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24495","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.27/LIPIcs.ESA.2025.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.27/LIPIcs.ESA.2025.27.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ergen, Ekin","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ergen, Ekin","raw_affiliation_strings":["Technical University of Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53447897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.3747999966144562,"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.3747999966144562,"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.24289999902248383,"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.09359999746084213,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8971999883651733},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7421000003814697},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6195999979972839},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5224000215530396},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5048999786376953},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4812999963760376}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8971999883651733},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7421000003814697},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6195999979972839},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5935999751091003},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5224000215530396},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5220999717712402},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5048999786376953},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36340001225471497},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2964000105857849},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.2572999894618988}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24495","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.27/LIPIcs.ESA.2025.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24495","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.27/LIPIcs.ESA.2025.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4746423065662384}],"awards":[{"id":"https://openalex.org/G1372115314","display_name":null,"funder_award_id":"EXC-2046","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7354608348","display_name":null,"funder_award_id":"EXC-2046/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7362566262","display_name":null,"funder_award_id":"EXC-2046/1","funder_id":"https://openalex.org/F4320330291","funder_display_name":"Berlin Mathematics Research Center MATH+"},{"id":"https://openalex.org/G7725451807","display_name":"EXC 2046: MATH+: Berlin Mathematics Research Center","funder_award_id":"390685689","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8964763783","display_name":null,"funder_award_id":"390685689","funder_id":"https://openalex.org/F4320330291","funder_display_name":"Berlin Mathematics Research Center MATH+"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320330291","display_name":"Berlin Mathematics Research Center MATH+","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110420506.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,78,114],"consider":[1],"a":[2,19,32,46,57],"natural":[3],"extension":[4],"of":[5,21,26,35,52,64,67,75,85,104,124,142],"online":[6,76,143],"makespan":[7,44,51],"scheduling":[8],"on":[9],"identical":[10],"parallel":[11],"machines":[12,39],"by":[13],"introducing":[14],"scenarios.":[15],"A":[16],"scenario":[17],"is":[18,29,59],"subset":[20],"jobs,":[22],"and":[23,69,81,107],"the":[24,36,42,49,65,73,96,99,108],"task":[25],"our":[27,105,130],"problem":[28,106,111],"to":[30,38,56,119,136],"find":[31],"global":[33],"assignment":[34],"jobs":[37],"so":[40],"that":[41],"maximum":[43,50],"under":[45],"scenario,":[47,58],"i.e.,":[48],"any":[53],"schedule":[54],"restricted":[55],"minimized.":[60],"For":[61],"varying":[62],"values":[63],"number":[66],"scenarios":[68],"machines,":[70],"we":[71,94],"explore":[72],"competitiveness":[74],"algorithms.":[77],"prove":[79],"tight":[80],"near-tight":[82],"bounds,":[83],"several":[84,140],"which":[86,132],"are":[87],"achieved":[88],"through":[89],"novel":[90],"constructions.":[91],"In":[92],"particular,":[93],"leverage":[95],"interplay":[97],"between":[98],"unit":[100],"processing":[101],"time":[102],"case":[103],"hypergraph":[109,116,144],"coloring":[110,117],"both":[112],"ways:":[113],"use":[115],"techniques":[118],"steer":[120],"an":[121],"adversarial":[122],"family":[123],"instances":[125],"proving":[126],"lower":[127,137],"bounds":[128,138],"for":[129,139],"problem,":[131],"in":[133],"turn":[134],"leads":[135],"variants":[141],"coloring.":[145]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-12-08T00:00:00"}