{"id":"https://openalex.org/W3088107432","doi":"https://doi.org/10.1007/978-3-030-80879-2_9","title":"Explorable Uncertainty in Scheduling with Non-uniform Testing Times","display_name":"Explorable Uncertainty in Scheduling with Non-uniform Testing Times","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3088107432","doi":"https://doi.org/10.1007/978-3-030-80879-2_9","mag":"3088107432"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-80879-2_9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-80879-2_9","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-80879-2_9.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-80879-2_9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Susanne Albers","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":null,"display_name":"Alexander Eckl","orcid":null},"institutions":[{"id":"https://openalex.org/I1338984714","display_name":"ADVA Optical Networking (Germany)","ror":"https://ror.org/055kr0e44","country_code":"DE","type":"company","lineage":["https://openalex.org/I1338984714"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Eckl","raw_affiliation_strings":["Advanced Optimization in a Networked Economy, Technical University of Munich, Arcisstra\u00dfe 21, 80333, Munich, Germany","Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Advanced Optimization in a Networked Economy, Technical University of Munich, Arcisstra\u00dfe 21, 80333, Munich, Germany","institution_ids":["https://openalex.org/I1338984714"]},{"raw_affiliation_string":"Department of Informatics, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":5.7704,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.96726929,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.8783000111579895,"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.8783000111579895,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.04879999905824661,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.009700000286102295,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7559999823570251},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6976000070571899},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6087999939918518},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5676000118255615},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.53329998254776},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5063999891281128},{"id":"https://openalex.org/keywords/unit-of-time","display_name":"Unit of time","score":0.46720001101493835},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4489000141620636},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.421999990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7810999751091003},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7559999823570251},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6976000070571899},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6087999939918518},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5063999891281128},{"id":"https://openalex.org/C112931104","wikidata":"https://www.wikidata.org/wiki/Q1790144","display_name":"Unit of time","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39100000262260437},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3677000105381012},{"id":"https://openalex.org/C2777131613","wikidata":"https://www.wikidata.org/wiki/Q18394147","display_name":"Retard","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.29739999771118164},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C87007009","wikidata":"https://www.wikidata.org/wiki/Q210832","display_name":"Statistical hypothesis testing","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.2660999894142151},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2556999921798706},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-80879-2_9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-80879-2_9","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-80879-2_9.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:2009.13316","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2009.13316","pdf_url":"https://arxiv.org/pdf/2009.13316","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:mediatum.ub.tum.de:node/1584090","is_oa":false,"landing_page_url":"https://mediatum.ub.tum.de/1584090","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-80879-2_9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-80879-2_9","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-80879-2_9.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4540657034","display_name":null,"funder_award_id":"GRK 2201","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3088107432.pdf","grobid_xml":"https://content.openalex.org/works/W3088107432.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1966156872","https://openalex.org/W1973833593","https://openalex.org/W2041077764","https://openalex.org/W2043675696","https://openalex.org/W2077048701","https://openalex.org/W2089939399","https://openalex.org/W2130519052","https://openalex.org/W2136127899","https://openalex.org/W2242792420","https://openalex.org/W2399017419","https://openalex.org/W2963122640","https://openalex.org/W2963159830","https://openalex.org/W4255654664","https://openalex.org/W6700441700","https://openalex.org/W6966620167"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,116],"problem":[2,105,143],"of":[3,10,23,53,72,85,89,165,169,213],"scheduling":[4],"with":[5,151,200],"testing":[6,69,108,139],"in":[7,134,154,172,177,218],"the":[8,21,27,51,65,83,87,93,104,112,142,155,163,167,173,178,184,211,215,219,222],"framework":[9],"explorable":[11],"uncertainty":[12],"models":[13],"environments":[14],"where":[15,67],"some":[16],"preliminary":[17],"action":[18],"can":[19,37],"influence":[20],"duration":[22,52],"a":[24,42,54,96,144,190,197],"task.":[25],"In":[26,99],"model,":[28],"each":[29],"job":[30],"has":[31],"an":[32],"unknown":[33],"processing":[34],"time":[35],"that":[36],"be":[38,47],"revealed":[39],"by":[40,123],"running":[41],"test.":[43],"Alternatively,":[44],"jobs":[45],"may":[46],"run":[48],"untested":[49],"for":[50,82,121,127,162,210],"given":[55,77],"upper":[56,80],"limit.":[57],"Recently,":[58],"D\u00fcrr":[59],"et":[60],"al.":[61],"[4]":[62],"have":[63,76],"studied":[64],"setting":[66,118],"all":[68],"times":[70,91,109,140,171],"are":[71],"unit":[73],"size":[74],"and":[75,79,92,110,147,180,221],"lower":[78,192],"bounds":[81],"objectives":[84],"minimizing":[86,166,214],"sum":[88,168],"completion":[90,170],"makespan":[94],"on":[95],"single":[97],"machine.":[98],"this":[100],"paper,":[101],"we":[102,187,205],"extend":[103],"to":[106],"non-uniform":[107],"present":[111,158,196],"first":[113,191],"competitive":[114,160,202,208],"algorithms.":[115],"general":[117,138],"is":[119],"motivated":[120],"example":[122],"online":[124],"user":[125],"surveys":[126],"market":[128],"prediction":[129],"or":[130],"querying":[131],"centralized":[132],"databases":[133],"distributed":[135],"computing.":[136],"Introducing":[137],"gives":[141],"new":[145,152],"flavor":[146],"requires":[148],"updated":[149],"methods":[150],"techniques":[153],"analysis.":[156],"We":[157,194],"constant":[159],"ratios":[161,209],"objective":[164,212],"deterministic":[174,220],"case,":[175],"both":[176,217],"non-preemptive":[179],"preemptive":[181,185],"setting.":[182,224],"For":[183],"setting,":[186],"additionally":[188],"give":[189,206],"bound.":[193],"also":[195],"randomized":[198,223],"algorithm":[199],"improved":[201],"ratio.":[203],"Furthermore,":[204],"tight":[207],"makespan,":[216]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2020-10-01T00:00:00"}