{"id":"https://openalex.org/W2081798943","doi":"https://doi.org/10.1137/s0097539797327180","title":"Approximation Techniques for Average Completion Time Scheduling","display_name":"Approximation Techniques for Average Completion Time Scheduling","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2081798943","doi":"https://doi.org/10.1137/s0097539797327180","mag":"2081798943"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797327180","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797327180","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"C. Chekuri","raw_affiliation_strings":["Lucent"],"affiliations":[{"raw_affiliation_string":"Lucent","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112923360","display_name":"R. Motwani","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Motwani","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044694980","display_name":"B. K. Natarajan","orcid":"https://orcid.org/0000-0002-5881-5072"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. Natarajan","raw_affiliation_strings":["Arcot Systems"],"affiliations":[{"raw_affiliation_string":"Arcot Systems","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I4210166639","display_name":"Dartmouth Hospital","ror":"https://ror.org/02j3qj605","country_code":"GB","type":"healthcare","lineage":["https://openalex.org/I4210166639"]},{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"C. Stein","raw_affiliation_strings":["Dartmouth College"],"affiliations":[{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I4210166639","https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I1322087612"],"apc_list":null,"apc_paid":null,"fwci":29.6221,"has_fulltext":false,"cited_by_count":145,"citation_normalized_percentile":{"value":0.99822778,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"1","first_page":"146","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.998199999332428,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9868000149726868,"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/randomized-rounding","display_name":"Randomized rounding","score":0.7582921981811523},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7457354068756104},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6369738578796387},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6365624666213989},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6063628196716309},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5874342322349548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5206609964370728},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.49426913261413574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43637949228286743},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4203363060951233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41649624705314636},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.39524132013320923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3610045611858368},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12193772196769714}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.7582921981811523},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7457354068756104},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6369738578796387},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6365624666213989},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6063628196716309},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5874342322349548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5206609964370728},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49426913261413574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43637949228286743},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4203363060951233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41649624705314636},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39524132013320923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3610045611858368},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12193772196769714},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797327180","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797327180","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1569458199","https://openalex.org/W1980289219","https://openalex.org/W1988328380","https://openalex.org/W1988770656","https://openalex.org/W1992370758","https://openalex.org/W2014071862","https://openalex.org/W2025235423","https://openalex.org/W2027077493","https://openalex.org/W2034424699","https://openalex.org/W2048936605","https://openalex.org/W2049994136","https://openalex.org/W2058225986","https://openalex.org/W2087746279","https://openalex.org/W2104680817","https://openalex.org/W2130418601","https://openalex.org/W2148204686"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W2507810539","https://openalex.org/W2117839333","https://openalex.org/W2035016254","https://openalex.org/W1966079129","https://openalex.org/W1991979416","https://openalex.org/W2053393096","https://openalex.org/W276709744"],"abstract_inverted_index":{"We":[0,53,63,106,169,204],"consider":[1,107],"the":[2,44,51,84,94,110,160,176,184,188,202],"problem":[3,31,96],"of":[4,112,159,178,183],"nonpreemptive":[5],"scheduling":[6,74,140],"to":[7,26,46,67,75,109,181,208],"minimize":[8,76],"average":[9,77],"(weighted)":[10],"completion":[11,78],"time,":[12],"allowing":[13],"for":[14,29,72,93,102,117,136,187,213],"release":[15,81],"dates,":[16],"parallel":[17,113,138],"machines,":[18],"and":[19,41,116,147],"precedence":[20,199,214],"constraints.":[21],"Recent":[22],"work":[23],"has":[24],"led":[25],"constant-factor":[27],"approximations":[28,146,164],"this":[30,60,118,206],"based":[32],"on":[33,50,201],"solving":[34],"a":[35,99,128,133,156,166,172],"preemptive":[36,129],"or":[37],"linear":[38],"programming":[39],"relaxation":[40,131,161],"then":[42],"using":[43],"solution":[45],"get":[47],"an":[48,88],"ordering":[49],"jobs.":[52,203],"introduce":[54,120],"several":[55],"new":[56,122],"techniques":[57],"which":[58],"generalize":[59],"basic":[61],"paradigm.":[62],"use":[64],"these":[65],"ideas":[66],"obtain":[68,87,209],"improved":[69,210],"approximation":[70,211],"algorithms":[71,141],"one-machine":[73,130,179],"time":[79],"with":[80],"dates.":[82],"In":[83],"process,":[85],"we":[86,119,125,153],"optimal":[89],"randomized":[90],"on-line":[91,104],"algorithm":[92],"same":[95],"that":[97,127,142,155,182],"beats":[98],"lower":[100],"bound":[101],"deterministic":[103],"algorithms.":[105],"extensions":[108],"case":[111],"machine":[114,139],"scheduling,":[115],"two":[121],"ideas:":[123],"first,":[124],"show":[126,154],"is":[132],"powerful":[134],"tool":[135],"designing":[137],"simultaneously":[143],"produce":[144],"good":[145],"have":[148],"small":[149],"running":[150],"times;":[151],"second,":[152],"nongreedy":[157],"\"rounding\"":[158],"yields":[162],"better":[163],"than":[165],"greedy":[167],"one.":[168],"also":[170],"prove":[171],"general":[173],"theorem":[174,193],"relating":[175],"value":[177],"relaxations":[180],"schedules":[185],"obtained":[186],"original":[189],"m-machine":[190],"problems.":[191],"This":[192],"applies":[194],"even":[195],"when":[196],"there":[197],"are":[198],"constraints":[200],"apply":[205],"result":[207],"ratios":[212],"graphs":[215],"such":[216],"as":[217],"in-trees,":[218],"out-trees,and":[219],"series-parallel":[220],"graphs.":[221]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}