{"id":"https://openalex.org/W1976831727","doi":"https://doi.org/10.1016/0166-218x(92)00176-m","title":"Scheduling identical parallel machines to minimize total weighted completion time","display_name":"Scheduling identical parallel machines to minimize total weighted completion time","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W1976831727","doi":"https://doi.org/10.1016/0166-218x(92)00176-m","mag":"1976831727"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(92)00176-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)00176-m","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/A5080414664","display_name":"Hocine Belouadah","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"H. Belouadah","raw_affiliation_strings":["Faculty of Mathematical Studies, University of Southampton, Southampton SO9 5NH, UK","Faculty of Mathematical Studies , University of Southampton , Southampton, SO9 5NH, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Studies, University of Southampton, Southampton SO9 5NH, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Faculty of Mathematical Studies , University of Southampton , Southampton, SO9 5NH, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110115423","display_name":"Chris N. Potts","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C.N. Potts","raw_affiliation_strings":["Faculty of Mathematical Studies, University of Southampton, Southampton SO9 5NH, UK","Faculty of Mathematical Studies , University of Southampton , Southampton, SO9 5NH, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Studies, University of Southampton, Southampton SO9 5NH, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Faculty of Mathematical Studies , University of Southampton , Southampton, SO9 5NH, UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.1325,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.77370365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"48","issue":"3","first_page":"201","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.991100013256073,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9854999780654907,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7901559472084045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7174646854400635},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5785691142082214},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5516364574432373},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5290670990943909},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49755099415779114},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4629076421260834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46273478865623474},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4262096583843231},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3538628816604614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2610948085784912},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08378955721855164}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7901559472084045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7174646854400635},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5785691142082214},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5516364574432373},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5290670990943909},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49755099415779114},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4629076421260834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46273478865623474},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4262096583843231},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3538628816604614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2610948085784912},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08378955721855164},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(92)00176-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)00176-m","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1548540712","https://openalex.org/W1569458199","https://openalex.org/W1983196874","https://openalex.org/W1988328380","https://openalex.org/W1991139730","https://openalex.org/W1993614399","https://openalex.org/W2017697298","https://openalex.org/W2021987086","https://openalex.org/W2024237395","https://openalex.org/W2031612682","https://openalex.org/W2038994007","https://openalex.org/W2058591900","https://openalex.org/W2067297441","https://openalex.org/W2092438148","https://openalex.org/W2113856408","https://openalex.org/W2124938557","https://openalex.org/W2139211712","https://openalex.org/W2317166116","https://openalex.org/W2323519467","https://openalex.org/W4236384091","https://openalex.org/W4242130683","https://openalex.org/W6633968520"],"related_works":["https://openalex.org/W2132137594","https://openalex.org/W2069783012","https://openalex.org/W2085967955","https://openalex.org/W197700457","https://openalex.org/W3146908064","https://openalex.org/W4256335355","https://openalex.org/W3098612666","https://openalex.org/W2235461833","https://openalex.org/W1499116563","https://openalex.org/W2182290077"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}