{"id":"https://openalex.org/W1965521122","doi":"https://doi.org/10.1016/0020-0190(94)00110-3","title":"A lower bound for randomized on-line scheduling algorithms","display_name":"A lower bound for randomized on-line scheduling algorithms","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W1965521122","doi":"https://doi.org/10.1016/0020-0190(94)00110-3","mag":"1965521122"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00110-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00110-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5037000066","display_name":"Bo Chen","orcid":"https://orcid.org/0000-0001-7605-9453"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bo Chen","raw_affiliation_strings":["Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]},{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands","institution_ids":["https://openalex.org/I913958620"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111733453","display_name":"Andr\u00e9 van Vliet","orcid":null},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 van Vliet","raw_affiliation_strings":["Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]},{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands","institution_ids":["https://openalex.org/I913958620"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria","Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria#TAB#","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.603,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.83858784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"51","issue":"5","first_page":"219","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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.9984999895095825,"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.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9945999979972839,"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-algorithm","display_name":"Randomized algorithm","score":0.6872041821479797},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.589668333530426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5174511075019836},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5010442733764648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4861569106578827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4305419921875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.412112832069397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3383778929710388},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.229562908411026}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6872041821479797},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.589668333530426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5174511075019836},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5010442733764648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4861569106578827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4305419921875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.412112832069397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3383778929710388},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.229562908411026},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0020-0190(94)00110-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00110-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/410f5508-25f9-4889-8fd0-d4a7f722760f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/410f5508-25f9-4889-8fd0-d4a7f722760f","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":"Chen, B, Vliet, van, A & Woeginger, G J 1994, 'A lower bound for randomized on-line scheduling algorithms', Information Processing Letters, vol. 51, no. 5, pp. 219-222. https://doi.org/10.1016/0020-0190(94)00110-3","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:680504","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=680504","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0020-0190","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:680504","is_oa":false,"landing_page_url":"http://repository.tue.nl/680504","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0020-0190","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/410f5508-25f9-4889-8fd0-d4a7f722760f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/410f5508-25f9-4889-8fd0-d4a7f722760f","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":"Information Processing Letters, 51(5), 219 - 222. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1544555851","https://openalex.org/W2056760235","https://openalex.org/W2073083283","https://openalex.org/W2084524235","https://openalex.org/W2089269509","https://openalex.org/W6632663626","https://openalex.org/W6664587208","https://openalex.org/W6671624997"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W4288278856","https://openalex.org/W2572370460","https://openalex.org/W2041927040"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}