{"id":"https://openalex.org/W2013170874","doi":"https://doi.org/10.1137/s0895480199357078","title":"Scheduling Unrelated Machines by Randomized Rounding","display_name":"Scheduling Unrelated Machines by Randomized Rounding","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2013170874","doi":"https://doi.org/10.1137/s0895480199357078","mag":"2013170874"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480199357078","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199357078","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103095757","display_name":"Andreas S. Schulz","orcid":"https://orcid.org/0000-0002-9595-459X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andreas S. Schulz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103095757"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.0636,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.97708507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"15","issue":"4","first_page":"450","last_page":"469"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/randomized-rounding","display_name":"Randomized rounding","score":0.8460273146629333},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6836374998092651},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6769436597824097},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6557918787002563},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6420220136642456},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.631348192691803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.539065420627594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43600165843963623},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43428534269332886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4230506420135498},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4214971661567688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4072000980377197},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3631811738014221},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35258352756500244}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.8460273146629333},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6836374998092651},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6769436597824097},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6557918787002563},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6420220136642456},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.631348192691803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.539065420627594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43600165843963623},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43428534269332886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4230506420135498},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4214971661567688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4072000980377197},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3631811738014221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35258352756500244},{"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480199357078","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199357078","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.6070","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.6070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-653-1999.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.3023","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.3023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/schulz/www/epapers/print/ss-sidma-2002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.7087","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-berlin.de/~skutella/SchulzSkut-SIDMA02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W36142361","https://openalex.org/W1482336804","https://openalex.org/W1488422606","https://openalex.org/W1508968115","https://openalex.org/W1517653283","https://openalex.org/W1519375772","https://openalex.org/W1526035966","https://openalex.org/W1531908439","https://openalex.org/W1543365144","https://openalex.org/W1544188233","https://openalex.org/W1544352564","https://openalex.org/W1585522101","https://openalex.org/W1586637507","https://openalex.org/W1621441552","https://openalex.org/W1739020267","https://openalex.org/W1903284337","https://openalex.org/W1960330418","https://openalex.org/W1969481001","https://openalex.org/W1969964129","https://openalex.org/W1973598192","https://openalex.org/W1974114807","https://openalex.org/W1988328380","https://openalex.org/W2008120342","https://openalex.org/W2008147296","https://openalex.org/W2014369282","https://openalex.org/W2015033265","https://openalex.org/W2021987086","https://openalex.org/W2022191808","https://openalex.org/W2026040656","https://openalex.org/W2031612682","https://openalex.org/W2041075508","https://openalex.org/W2056273707","https://openalex.org/W2058817479","https://openalex.org/W2080167233","https://openalex.org/W2081798943","https://openalex.org/W2085325317","https://openalex.org/W2090735305","https://openalex.org/W2092438148","https://openalex.org/W2102588682","https://openalex.org/W2103559566","https://openalex.org/W2121129818","https://openalex.org/W2126520302","https://openalex.org/W2139444324","https://openalex.org/W2148204686","https://openalex.org/W2159152246","https://openalex.org/W2179016037","https://openalex.org/W2295428206","https://openalex.org/W2607875432","https://openalex.org/W2743045177","https://openalex.org/W2808213670","https://openalex.org/W3122565517","https://openalex.org/W4231916799","https://openalex.org/W4232445964","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1798514331","https://openalex.org/W2499939553","https://openalex.org/W1991979416","https://openalex.org/W2268207117","https://openalex.org/W2117839333","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2137652805","https://openalex.org/W3023240533","https://openalex.org/W2013170874"],"abstract_inverted_index":{"We":[0,73],"present":[1],"a":[2,40,52,64],"new":[3],"class":[4],"of":[5,80],"randomized":[6],"approximation":[7,127],"algorithms":[8],"for":[9,55,89,129],"unrelated":[10],"parallel":[11,91,131],"machine":[12,92,104,132],"scheduling":[13,93,133],"problems":[14],"with":[15,32,58,147],"the":[16,56,78,81,113,126,136],"average":[17],"weighted":[18],"completion":[19],"time":[20,117,144],"objective.":[21],"The":[22],"key":[23],"idea":[24],"is":[25,85,105],"to":[26,30,39,99,135],"assign":[27],"jobs":[28,69,95,141],"randomly":[29,97],"machines":[31],"probabilities":[33],"derived":[34],"from":[35],"an":[36,86],"optimal":[37],"solution":[38],"linear":[41],"programming":[42],"(LP)":[43],"relaxation":[44],"in":[45,101,110,139,150],"time-indexed":[46],"variables.":[47],"Our":[48],"main":[49],"results":[50],"are":[51,70,96],"$(2+\\varepsilon)$-approximation":[53],"algorithm":[54,66,114],"model":[57],"individual":[59],"job":[60],"release":[61],"dates":[62],"and":[63,121],"$(3/2+\\varepsilon)$-approximation":[65],"if":[67],"all":[68],"released":[71],"simultaneously.":[72],"obtain":[74],"corresponding":[75],"bounds":[76],"on":[77],"quality":[79],"LP":[82],"relaxation.":[83],"It":[84],"interesting":[87],"implication":[88],"identical":[90,130],"that":[94],"assigned":[98],"machines,":[100],"which":[102,140],"each":[103],"equally":[106],"likely.":[107],"In":[108],"addition,":[109],"this":[111],"case":[112],"has":[115],"running":[116],"O(n":[118],"log":[119],"n)":[120],"performance":[122,151],"guarantee":[123],"2.":[124],"Moreover,":[125],"result":[128],"applies":[134],"on-line":[137],"setting":[138],"arrive":[142],"over":[143],"as":[145],"well,":[146],"no":[148],"difference":[149],"guarantee.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}