{"id":"https://openalex.org/W2118097248","doi":"https://doi.org/10.1016/s0167-6377(01)00115-8","title":"Randomized algorithms for on-line scheduling problems: how low can't you go?","display_name":"Randomized algorithms for on-line scheduling problems: how low can't you go?","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2118097248","doi":"https://doi.org/10.1016/s0167-6377(01)00115-8","mag":"2118097248"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(01)00115-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(01)00115-8","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/1897702/539392.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044184077","display_name":"Leen Stougie","orcid":"https://orcid.org/0000-0001-6938-8902"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Leen Stougie","raw_affiliation_strings":["Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, and CWI, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, and CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025188423","display_name":"Arjen P.A. Vestjens","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arjen P.A. Vestjens","raw_affiliation_strings":["Center for Quantitative Methods (CQM), Eindhoven, The Netherlands","Center for Quantitative Methods (CQM), Eindhoven, The Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Quantitative Methods (CQM), Eindhoven, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Center for Quantitative Methods (CQM), Eindhoven, The Netherlands#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044184077"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":2.8023,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90639407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"2","first_page":"89","last_page":"96"},"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.992900013923645,"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-algorithm","display_name":"Randomized algorithm","score":0.8205904960632324},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6199803352355957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6081171035766602},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5969380140304565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5642215609550476},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5446365475654602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3974648714065552},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2743954360485077}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.8205904960632324},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6199803352355957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6081171035766602},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5969380140304565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5642215609550476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5446365475654602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3974648714065552},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2743954360485077},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1016/s0167-6377(01)00115-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(01)00115-8","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/a72ff81a-cc89-4351-9ddc-df67bb012f86","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a72ff81a-cc89-4351-9ddc-df67bb012f86","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":"Stougie, L & Vestjens, A P A 2002, 'Randomized algorithms for on-line scheduling problems : how low can't you go?', Operations Research Letters, vol. 30, no. 2, pp. 89-96. https://doi.org/10.1016/S0167-6377(01)00115-8","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/15b283ec-484d-4761-b943-76571e979fa0","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/15b283ec-484d-4761-b943-76571e979fa0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stougie, L & Vestjens, A P A 2002, 'Randomized algorithms for on-line scheduling problems : how low can't you go?', Operations Research Letters, vol. 30, no. 2, pp. 89-96. https://doi.org/10.1016/S0167-6377(01)00115-8","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/2b2504be-4fa2-4a73-a6b8-a87112c375f4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/2b2504be-4fa2-4a73-a6b8-a87112c375f4","pdf_url":"https://pure.tue.nl/ws/files/1897702/539392.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stougie, L & Vestjens, A P A 2000, Randomized algorithms for on-line scheduling problems : how low can't you go? SPOR-Report : reports in statistics, probability and operations research, vol. 200013, Technische Universiteit Eindhoven, Eindhoven.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:623544","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623544","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6377","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a72ff81a-cc89-4351-9ddc-df67bb012f86","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/a72ff81a-cc89-4351-9ddc-df67bb012f86","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":"Operations Research Letters, 30(2), 89 - 96. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/2b2504be-4fa2-4a73-a6b8-a87112c375f4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/2b2504be-4fa2-4a73-a6b8-a87112c375f4","pdf_url":"https://pure.tue.nl/ws/files/1897702/539392.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stougie, L & Vestjens, A P A 2000, Randomized algorithms for on-line scheduling problems : how low can't you go? SPOR-Report : reports in statistics, probability and operations research, vol. 200013, Technische Universiteit Eindhoven, Eindhoven.","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.46000000834465027,"display_name":"Decent work and economic growth"},{"id":"https://metadata.un.org/sdg/9","score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2118097248.pdf","grobid_xml":"https://content.openalex.org/works/W2118097248.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W964861289","https://openalex.org/W1585522101","https://openalex.org/W1903284337","https://openalex.org/W1971354639","https://openalex.org/W2008147296","https://openalex.org/W2011039300","https://openalex.org/W2023146810","https://openalex.org/W2026392075","https://openalex.org/W2038990377","https://openalex.org/W2050329843","https://openalex.org/W2056273707","https://openalex.org/W2069466073","https://openalex.org/W2103559566","https://openalex.org/W2165265954","https://openalex.org/W2179639784","https://openalex.org/W2576116471","https://openalex.org/W6611400792","https://openalex.org/W6635139686"],"related_works":["https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2154716867","https://openalex.org/W2011643166","https://openalex.org/W4243213822","https://openalex.org/W2090027528","https://openalex.org/W1996806106","https://openalex.org/W2165839536","https://openalex.org/W1967323656","https://openalex.org/W2208110155"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}