{"id":"https://openalex.org/W1495318280","doi":"https://doi.org/10.1007/3-540-44929-9_9","title":"An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks","display_name":"An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1495318280","doi":"https://doi.org/10.1007/3-540-44929-9_9","mag":"1495318280"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44929-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44929-9_9","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/A5036531018","display_name":"Yoojin Chung","orcid":"https://orcid.org/0000-0002-8772-5308"},"institutions":[{"id":"https://openalex.org/I4921948","display_name":"Pusan National University","ror":"https://ror.org/01an57a31","country_code":"KR","type":"education","lineage":["https://openalex.org/I4921948"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoojin Chung","raw_affiliation_strings":["Research Institute of Computer and Information & Communication, Pusan National University, Pusan, 609-735, Korea"],"affiliations":[{"raw_affiliation_string":"Research Institute of Computer and Information & Communication, Pusan National University, Pusan, 609-735, Korea","institution_ids":["https://openalex.org/I4921948"]}]},{"author_position":"middle","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-742, Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089151678","display_name":"Hyuk\u2010Chul Kwon","orcid":null},"institutions":[{"id":"https://openalex.org/I4921948","display_name":"Pusan National University","ror":"https://ror.org/01an57a31","country_code":"KR","type":"education","lineage":["https://openalex.org/I4921948"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyuk-Chul Kwon","raw_affiliation_strings":["Division of Computer Science and Engineering, Pusan National University, Pusan, 609-735, Korea"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science and Engineering, Pusan National University, Pusan, 609-735, Korea","institution_ids":["https://openalex.org/I4921948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036531018"],"corresponding_institution_ids":["https://openalex.org/I4921948"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08034398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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.9991999864578247,"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.9987000226974487,"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.9983999729156494,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6722375750541687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6550270318984985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5515689849853516},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5415523052215576},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5385689735412598},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5385279655456543},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5372772812843323},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5123003721237183},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.49477261304855347},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.483806312084198},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4683016836643219},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.417972207069397},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4173640012741089},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3725830316543579},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3423922061920166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28467679023742676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13717404007911682},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13564535975456238},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10031664371490479}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6722375750541687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550270318984985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5515689849853516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5415523052215576},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5385689735412598},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5385279655456543},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5372772812843323},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5123003721237183},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.49477261304855347},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.483806312084198},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4683016836643219},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.417972207069397},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4173640012741089},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3725830316543579},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3423922061920166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28467679023742676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13717404007911682},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13564535975456238},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10031664371490479},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44929-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44929-9_9","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"}],"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/W35758821","https://openalex.org/W54958985","https://openalex.org/W1501934796","https://openalex.org/W1553674362","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/W2167567627"],"related_works":["https://openalex.org/W2992826608","https://openalex.org/W2056770221","https://openalex.org/W1998998849","https://openalex.org/W1555816812","https://openalex.org/W2093369082","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1838063489","https://openalex.org/W1577155814","https://openalex.org/W2099271296"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}