{"id":"https://openalex.org/W1978376940","doi":"https://doi.org/10.1137/0212004","title":"Bounds for Multifit Scheduling on Uniform Processors","display_name":"Bounds for Multifit Scheduling on Uniform Processors","publication_year":1983,"publication_date":"1983-02-01","ids":{"openalex":"https://openalex.org/W1978376940","doi":"https://doi.org/10.1137/0212004","mag":"1978376940"},"language":"en","primary_location":{"id":"doi:10.1137/0212004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5059076709","display_name":"Donald K. Friesen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. K. Friesen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. A. Langston","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6512,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96929201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"60","last_page":"70"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8144661784172058},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.674091100692749},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6557034254074097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.642332136631012},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5696464776992798},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5642213821411133},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49886393547058105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49346983432769775},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4150409996509552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3537285625934601},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.29024025797843933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27457165718078613},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.19303801655769348}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8144661784172058},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.674091100692749},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6557034254074097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.642332136631012},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5696464776992798},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5642213821411133},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49886393547058105},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49346983432769775},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4150409996509552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3537285625934601},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.29024025797843933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27457165718078613},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.19303801655769348},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0212004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1978732961","https://openalex.org/W1992734168","https://openalex.org/W2011039300","https://openalex.org/W2019133545","https://openalex.org/W2020196988","https://openalex.org/W2048905935","https://openalex.org/W2104680817","https://openalex.org/W4251714866"],"related_works":["https://openalex.org/W2547262947","https://openalex.org/W2060747552","https://openalex.org/W2987766391","https://openalex.org/W2371579306","https://openalex.org/W2385645884","https://openalex.org/W2921419089","https://openalex.org/W2008981005","https://openalex.org/W2786628242","https://openalex.org/W11568090","https://openalex.org/W2029755858"],"abstract_inverted_index":{"We":[0,84],"examine":[1],"the":[2,17,21,24,28,38,79,82,89,107],"nonpreemptive":[3],"assignment":[4],"of":[5,12,19,30,40,81,88,106],"N":[6],"independent":[7],"tasks":[8,34],"to":[9,48,54],"a":[10,42,86],"system":[11],"M":[13],"uniform":[14],"processors":[15],"with":[16],"objective":[18],"reducing":[20],"makespan,":[22],"or":[23],"time":[25,73],"required":[26],"from":[27,93],"start":[29],"execution":[31],"until":[32],"all":[33],"are":[35,76],"completed.":[36],"Since":[37],"problem":[39],"finding":[41],"minimal":[43],"makespan":[44],"has":[45],"been":[46,64],"shown":[47],"be":[49],"NP-hard,":[50],"and":[51,96],"hence":[52],"unlikely":[53],"permit":[55],"an":[56],"efficient":[57],"solution":[58],"procedure,":[59],"near-optimal":[60],"heuristic":[61],"algorithms":[62],"have":[63],"studied.":[65],"It":[66],"is":[67,103],"known":[68],"that":[69,98],"LPT":[70],"(longest":[71],"processing":[72],"first)":[74],"schedules":[75],"within":[77,104],"twice":[78],"length":[80],"optimum.":[83,108],"analyze":[85],"variation":[87],"MULTIFIT":[90],"algorithm":[91],"derived":[92],"bin":[94],"packing,":[95],"prove":[97],"its":[99],"worst-case":[100],"performance":[101],"bound":[102],"1.4":[105]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}