{"id":"https://openalex.org/W2076406733","doi":"https://doi.org/10.1016/s0885-064x(03)00028-1","title":"An efficient parallel algorithm for scheduling interval ordered tasks","display_name":"An efficient parallel algorithm for scheduling interval ordered tasks","publication_year":2003,"publication_date":"2003-04-25","ids":{"openalex":"https://openalex.org/W2076406733","doi":"https://doi.org/10.1016/s0885-064x(03)00028-1","mag":"2076406733"},"language":"en","primary_location":{"id":"doi:10.1016/s0885-064x(03)00028-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0885-064x(03)00028-1","pdf_url":null,"source":{"id":"https://openalex.org/S42286584","display_name":"Journal of Complexity","issn_l":"0885-064X","issn":["0885-064X","1090-2708"],"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":"Journal of Complexity","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/A5036531018","display_name":"Yoojin Chung","orcid":"https://orcid.org/0000-0002-8772-5308"},"institutions":[{"id":"https://openalex.org/I83436808","display_name":"Hankuk University of Foreign Studies","ror":"https://ror.org/051q2m369","country_code":"KR","type":"education","lineage":["https://openalex.org/I83436808"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoojin Chung","raw_affiliation_strings":["Department of Computer Engineering, Hankuk University of Foreign Studies, Kyonggi-do 449-791, South Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Hankuk University of Foreign Studies, Kyonggi-do 449-791, South Korea#TAB#","institution_ids":["https://openalex.org/I83436808"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kunsoo Park","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National University, Seoul 151\u2010742, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National University, Seoul 151\u2010742, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036531018"],"corresponding_institution_ids":["https://openalex.org/I83436808"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1733017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"4","first_page":"597","last_page":"609"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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.9975000023841858,"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/scheduling","display_name":"Scheduling (production processes)","score":0.5055170059204102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4877925217151642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48090457916259766},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4492156505584717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4285619854927063},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3557701110839844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3468266725540161},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3022187352180481}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5055170059204102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4877925217151642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48090457916259766},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4492156505584717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4285619854927063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3557701110839844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3468266725540161},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3022187352180481}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0885-064x(03)00028-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0885-064x(03)00028-1","pdf_url":null,"source":{"id":"https://openalex.org/S42286584","display_name":"Journal of Complexity","issn_l":"0885-064X","issn":["0885-064X","1090-2708"],"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":"Journal of Complexity","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":21,"referenced_works":["https://openalex.org/W35758821","https://openalex.org/W54958985","https://openalex.org/W1501934796","https://openalex.org/W1556711032","https://openalex.org/W1970682062","https://openalex.org/W1973538756","https://openalex.org/W1976306508","https://openalex.org/W1978583881","https://openalex.org/W1981314573","https://openalex.org/W1996256520","https://openalex.org/W2027077493","https://openalex.org/W2059310886","https://openalex.org/W2060983467","https://openalex.org/W2061080407","https://openalex.org/W2088199596","https://openalex.org/W2092333800","https://openalex.org/W2093369082","https://openalex.org/W2149204009","https://openalex.org/W2157110847","https://openalex.org/W2167567627","https://openalex.org/W6601411797"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2002282073","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/W1991411408","https://openalex.org/W4288278856"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}