{"id":"https://openalex.org/W2019636973","doi":"https://doi.org/10.1016/0167-6377(92)90035-2","title":"A new dynamic programming algorithm for the parallel machines total weighted completion time problem","display_name":"A new dynamic programming algorithm for the parallel machines total weighted completion time problem","publication_year":1992,"publication_date":"1992-03-01","ids":{"openalex":"https://openalex.org/W2019636973","doi":"https://doi.org/10.1016/0167-6377(92)90035-2","mag":"2019636973"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(92)90035-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90035-2","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research 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/A5072776653","display_name":"Chung\u2010Yee Lee","orcid":"https://orcid.org/0000-0002-7006-2974"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chung-Yee Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044657641","display_name":"Reha Uzsoy","orcid":"https://orcid.org/0000-0002-8068-550X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reha Uzsoy","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA","School of Industrial Engineering, Purdue University , West Lafayette, IN 47907, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Industrial Engineering, Purdue University , West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072776653"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":2.0599,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.86424855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"2","first_page":"73","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9962000250816345,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.7267800569534302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5993209481239319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5828198790550232},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5750846862792969},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45679381489753723},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3464290201663971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32822906970977783}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7267800569534302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5993209481239319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5828198790550232},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5750846862792969},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45679381489753723},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3464290201663971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32822906970977783},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0167-6377(92)90035-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90035-2","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-54826","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-54826","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.7400000095367432,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2021987086","https://openalex.org/W2031612682","https://openalex.org/W2067297441","https://openalex.org/W2084517692","https://openalex.org/W2084814858","https://openalex.org/W2107216979","https://openalex.org/W2124938557","https://openalex.org/W2323519467"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W814774360","https://openalex.org/W1774334694"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}