{"id":"https://openalex.org/W1491075941","doi":"https://doi.org/10.1007/3-540-48224-5_71","title":"On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates","display_name":"On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1491075941","doi":"https://doi.org/10.1007/3-540-48224-5_71","mag":"1491075941"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_71","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/A5005932160","display_name":"Aleksei V. Fishkin","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Aleksei V. Fishkin","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24 098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24 098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24 098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24 098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033762785","display_name":"Lorant Porkolab","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133790","display_name":"PricewaterhouseCoopers (United Kingdom)","ror":"https://ror.org/041gev667","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210133790"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lorant Porkolab","raw_affiliation_strings":["PricewaterhouseCoopers, Applied Decision Analysis, 1 Embankment Place, London, WC2N 6RH, UK"],"affiliations":[{"raw_affiliation_string":"PricewaterhouseCoopers, Applied Decision Analysis, 1 Embankment Place, London, WC2N 6RH, UK","institution_ids":["https://openalex.org/I4210133790"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005932160"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":13.7156,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.98717949,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"886"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9952999949455261,"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.9902999997138977,"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/computer-science","display_name":"Computer science","score":0.794154167175293},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7682152986526489},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6883794069290161},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6624299883842468},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5728816986083984},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.5326952934265137},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5278969407081604},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5230989456176758},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4637961983680725},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4601162075996399},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4578262269496918},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4456768035888672},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3954373896121979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.319914311170578},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.17774325609207153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14395013451576233},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0627177357673645}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.794154167175293},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7682152986526489},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6883794069290161},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6624299883842468},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5728816986083984},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5326952934265137},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5278969407081604},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5230989456176758},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4637961983680725},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4601162075996399},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4578262269496918},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4456768035888672},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3954373896121979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.319914311170578},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.17774325609207153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14395013451576233},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0627177357673645},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-48224-5_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_71","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.297","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/staff/kj_files/ICALP01.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1531298970","https://openalex.org/W1531908439","https://openalex.org/W1903284337","https://openalex.org/W1912586891","https://openalex.org/W1969481001","https://openalex.org/W1978007997","https://openalex.org/W1988328380","https://openalex.org/W1998948241","https://openalex.org/W2011039300","https://openalex.org/W2012491806","https://openalex.org/W2050331342","https://openalex.org/W2058422149","https://openalex.org/W2082853263","https://openalex.org/W2135507920","https://openalex.org/W2148204686","https://openalex.org/W2167170540","https://openalex.org/W2736018979","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W4244289241","https://openalex.org/W1998948241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2101964286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}