{"id":"https://openalex.org/W1511733714","doi":"https://doi.org/10.1007/3-540-36494-3_24","title":"Non-clairvoyant Scheduling for Minimizing Mean Slowdown","display_name":"Non-clairvoyant Scheduling for Minimizing Mean Slowdown","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1511733714","doi":"https://doi.org/10.1007/3-540-36494-3_24","mag":"1511733714"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-36494-3_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36494-3_24","pdf_url":null,"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":null,"license_id":null,"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":["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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"N. Bansal","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024390954","display_name":"Kedar Dhamdhere","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Dhamdhere","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. K\u00f6nemann","raw_affiliation_strings":["Graduate School of Industrial Administration, Carnegie Mellon University, 15213, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024448261","display_name":"Amitabh Sinha","orcid":"https://orcid.org/0000-0002-6035-3671"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Sinha","raw_affiliation_strings":["Graduate School of Industrial Administration, Carnegie Mellon University, 15213, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.1284,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87631428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"260","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9918000102043152,"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/slowdown","display_name":"Slowdown","score":0.903608500957489},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7611393928527832},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6373949646949768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6135891079902649},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6059005856513977},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.532495379447937},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5291125178337097},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5143531560897827},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4699808657169342},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4650733470916748},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4361332356929779},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33300548791885376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3153689503669739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24602264165878296},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13891908526420593},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.08461412787437439}],"concepts":[{"id":"https://openalex.org/C2777242750","wikidata":"https://www.wikidata.org/wiki/Q31351","display_name":"Slowdown","level":2,"score":0.903608500957489},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7611393928527832},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6373949646949768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6135891079902649},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6059005856513977},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.532495379447937},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5291125178337097},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5143531560897827},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4699808657169342},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4650733470916748},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4361332356929779},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33300548791885376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3153689503669739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24602264165878296},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13891908526420593},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.08461412787437439},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-36494-3_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36494-3_24","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/4e4c5169-6d73-4227-ba42-2ab1ef233922","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/4e4c5169-6d73-4227-ba42-2ab1ef233922","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Dhamdhere, K, K\u00f6nemann, J & Sinha, A 2003, Non-clairvoyant scheduling for minimizing mean slowdown. in H Alt & M Habib (eds), STACS 2003 (20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003. Proceedings). Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, pp. 260-270. https://doi.org/10.1007/3-540-36494-3_24","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/4e4c5169-6d73-4227-ba42-2ab1ef233922","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/4e4c5169-6d73-4227-ba42-2ab1ef233922","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STACS 2003 (20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003. Proceedings), 260 - 270","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1606894208","https://openalex.org/W1747987134","https://openalex.org/W1916709771","https://openalex.org/W1958713532","https://openalex.org/W1972868674","https://openalex.org/W1984591711","https://openalex.org/W1988328380","https://openalex.org/W2012502482","https://openalex.org/W2051216594","https://openalex.org/W2060640049","https://openalex.org/W2067330646","https://openalex.org/W2071404693","https://openalex.org/W2074109829","https://openalex.org/W2086365412","https://openalex.org/W2117876074","https://openalex.org/W2164216960","https://openalex.org/W2751601659","https://openalex.org/W2912168264","https://openalex.org/W6636079778","https://openalex.org/W6668291574"],"related_works":["https://openalex.org/W2625359686","https://openalex.org/W2772037640","https://openalex.org/W3170311813","https://openalex.org/W4287122694","https://openalex.org/W2047204419","https://openalex.org/W2077830932","https://openalex.org/W2036784014","https://openalex.org/W2063410603","https://openalex.org/W4241266436","https://openalex.org/W2561982880"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}