{"id":"https://openalex.org/W2037865041","doi":"https://doi.org/10.1016/s0304-3975(02)00850-2","title":"On maximizing the throughput of multiprocessor tasks","display_name":"On maximizing the throughput of multiprocessor tasks","publication_year":2003,"publication_date":"2003-03-26","ids":{"openalex":"https://openalex.org/W2037865041","doi":"https://doi.org/10.1016/s0304-3975(02)00850-2","mag":"2037865041"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(02)00850-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(02)00850-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397502008502/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0304397502008502/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005932160","display_name":"Aleksei V. Fishkin","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Aleksei V. Fishkin","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany","Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027216962","display_name":"Guochuan Zhang","orcid":"https://orcid.org/0000-0003-1947-7872"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Guochuan Zhang","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany","Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027216962"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":0.7577,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78291211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"302","issue":"1-3","first_page":"319","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9977999925613403,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.737250566482544},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6725446581840515},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6717570424079895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.612586259841919},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5936817526817322},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5799264907836914},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5184066295623779},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49838995933532715},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.492735892534256},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4906667470932007},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3828809857368469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38148191571235657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3544577360153198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3431689143180847},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3339807987213135},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.0603710412979126}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.737250566482544},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6725446581840515},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6717570424079895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.612586259841919},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5936817526817322},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5799264907836914},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5184066295623779},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49838995933532715},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.492735892534256},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4906667470932007},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3828809857368469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38148191571235657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3544577360153198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3431689143180847},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3339807987213135},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.0603710412979126},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(02)00850-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(02)00850-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397502008502/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0304-3975(02)00850-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(02)00850-2","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397502008502/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2037865041.pdf","grobid_xml":"https://content.openalex.org/works/W2037865041.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1556368910","https://openalex.org/W1980008867","https://openalex.org/W1998948241","https://openalex.org/W2011039300","https://openalex.org/W2038019409","https://openalex.org/W2043078530","https://openalex.org/W2047173920","https://openalex.org/W2050331342","https://openalex.org/W2068426617","https://openalex.org/W2081254453","https://openalex.org/W2127960094","https://openalex.org/W2135507920","https://openalex.org/W2169146618","https://openalex.org/W2341350247","https://openalex.org/W4254424307","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2970302286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}