{"id":"https://openalex.org/W2020196988","doi":"https://doi.org/10.1137/0213013","title":"Tighter Bounds for the Multifit Processor Scheduling Algorithm","display_name":"Tighter Bounds for the Multifit Processor Scheduling Algorithm","publication_year":1984,"publication_date":"1984-02-01","ids":{"openalex":"https://openalex.org/W2020196988","doi":"https://doi.org/10.1137/0213013","mag":"2020196988"},"language":"en","primary_location":{"id":"doi:10.1137/0213013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213013","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":true,"raw_author_name":"Donald K. Friesen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059076709"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.2621,"has_fulltext":false,"cited_by_count":122,"citation_normalized_percentile":{"value":0.9800054,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"1","first_page":"170","last_page":"181"},"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.9993000030517578,"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7164387702941895},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.684916615486145},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.639430046081543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.539050281047821},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5138357281684875},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4877699017524719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3291690945625305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2108602225780487},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.18725648522377014}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7164387702941895},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.684916615486145},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.639430046081543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.539050281047821},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5138357281684875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4877699017524719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3291690945625305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2108602225780487},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.18725648522377014},{"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/0213013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213013","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":[{"id":"https://metadata.un.org/sdg/8","score":0.41999998688697815,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W2019133545","https://openalex.org/W2067297441","https://openalex.org/W2104680817"],"related_works":["https://openalex.org/W997954202","https://openalex.org/W4236295709","https://openalex.org/W2530969325","https://openalex.org/W2520902986","https://openalex.org/W1507894569","https://openalex.org/W3174582865","https://openalex.org/W2546696010","https://openalex.org/W2140012984","https://openalex.org/W2997221951","https://openalex.org/W4308087753"],"abstract_inverted_index":{"This":[0],"paper":[1,64,72],"considers":[2],"the":[3,17,21,27,56,67,74],"problem":[4],"of":[5,19,30,78],"nonpreemptively":[6],"scheduling":[7],"n":[8],"independent":[9],"jobs":[10],"on":[11,73],"m":[12],"identical,":[13],"parallel":[14],"processors":[15],"with":[16],"object":[18],"minimizing":[20],"\u201cmakespan\u201d,":[22],"or":[23],"completion":[24],"time":[25,59],"for":[26],"entire":[28],"set":[29],"jobs.":[31],"Coffman,":[32],"Garey,":[33],"and":[34,94],"Johnson":[35],"[SIAM":[36],"J.":[37],"Comput.,":[38],"7":[39],"(1978),":[40],"pp.":[41],"1\u201317]":[42],"described":[43],"an":[44,83],"algorithm":[45,80],"MULTIFIT":[46],"which":[47],"has":[48],"a":[49],"considerably":[50],"better":[51],"worst":[52,75],"case":[53,76],"performance":[54],"than":[55,102],"largest":[57],"processing":[58],"first":[60],"algorithm.":[61],"In":[62],"this":[63,79],"we":[65],"tighten":[66],"bounds":[68],"obtained":[69],"in":[70],"that":[71,86,96],"behavior":[77],"by":[81],"giving":[82],"example":[84],"showing":[85],"it":[87,97],"may":[88],"be":[89,99],"as":[90,92],"bad":[91],"13/11":[93],"proving":[95],"can":[98],"no":[100],"worse":[101],"6/5.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}