{"id":"https://openalex.org/W2054465734","doi":"https://doi.org/10.1016/s0020-0190(98)00131-8","title":"Real-time scheduling algorithm for minimizing maximum weighted error with O(N log N + cN) complexity","display_name":"Real-time scheduling algorithm for minimizing maximum weighted error with O(N log N + cN) complexity","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2054465734","doi":"https://doi.org/10.1016/s0020-0190(98)00131-8","mag":"2054465734"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(98)00131-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00131-8","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/A5008223903","display_name":"Kyunghee Choi","orcid":"https://orcid.org/0000-0002-5255-0966"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyunghee Choi","raw_affiliation_strings":["School of IE&CE, Ajou University, Suwon, South Korea, 442-749"],"affiliations":[{"raw_affiliation_string":"School of IE&CE, Ajou University, Suwon, South Korea, 442-749","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111980810","display_name":"Gihyun Jung","orcid":null},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Gihyun Jung","raw_affiliation_strings":["School of EE, Ajou University, Suwon, South Korea, 442-749"],"affiliations":[{"raw_affiliation_string":"School of EE, Ajou University, Suwon, South Korea, 442-749","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071806015","display_name":"Tae-Geun Kim","orcid":"https://orcid.org/0009-0000-4229-2935"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Taegeun Kim","raw_affiliation_strings":["SERI, Taejeon, South Korea, 305-600"],"affiliations":[{"raw_affiliation_string":"SERI, Taejeon, South Korea, 305-600","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005621874","display_name":"Seunhun Jung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seunhun Jung","raw_affiliation_strings":["KETI, PeungtaekSi, KyunggiDo, South Korea, 451-860"],"affiliations":[{"raw_affiliation_string":"KETI, PeungtaekSi, KyunggiDo, South Korea, 451-860","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111980810"],"corresponding_institution_ids":["https://openalex.org/I57664883"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.535,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75132184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"67","issue":"6","first_page":"311","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9936000108718872,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9936000108718872,"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/T12288","display_name":"Optimization and Search Problems","score":0.9909999966621399,"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.9897000193595886,"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/time-complexity","display_name":"Time complexity","score":0.6146714091300964},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5889034271240234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5792386531829834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.545711100101471},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5030199885368347},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4404544532299042},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42773541808128357},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4203781485557556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3577222228050232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33609652519226074}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6146714091300964},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5889034271240234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5792386531829834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.545711100101471},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5030199885368347},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4404544532299042},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42773541808128357},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4203781485557556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3577222228050232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33609652519226074},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(98)00131-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00131-8","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1565527413","https://openalex.org/W1985907895","https://openalex.org/W2003879538","https://openalex.org/W2014808299","https://openalex.org/W2161419436","https://openalex.org/W2210192189","https://openalex.org/W4235236642","https://openalex.org/W6633682156"],"related_works":["https://openalex.org/W4231775656","https://openalex.org/W2046435967","https://openalex.org/W2383646825","https://openalex.org/W2807251790","https://openalex.org/W2371018915","https://openalex.org/W2354191502","https://openalex.org/W1972225038","https://openalex.org/W3134658850","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}