{"id":"https://openalex.org/W2019133545","doi":"https://doi.org/10.1137/0207001","title":"An Application of Bin-Packing to Multiprocessor Scheduling","display_name":"An Application of Bin-Packing to Multiprocessor Scheduling","publication_year":1978,"publication_date":"1978-02-01","ids":{"openalex":"https://openalex.org/W2019133545","doi":"https://doi.org/10.1137/0207001","mag":"2019133545"},"language":"en","primary_location":{"id":"doi:10.1137/0207001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207001","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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. G. Coffman, Jr.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110463438"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":31.858,"has_fulltext":false,"cited_by_count":657,"citation_normalized_percentile":{"value":0.99814195,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"7","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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/T12176","display_name":"Optimization and Packing Problems","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9973999857902527,"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/multiprocessing","display_name":"Multiprocessing","score":0.8079306483268738},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.7882237434387207},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7848145961761475},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7288830876350403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6676491498947144},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6520031690597534},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6019043922424316},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.43657582998275757},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.34867849946022034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22855022549629211},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22761499881744385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22558918595314026},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.19065600633621216},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.18132859468460083}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.8079306483268738},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.7882237434387207},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7848145961761475},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7288830876350403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6676491498947144},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6520031690597534},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6019043922424316},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.43657582998275757},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34867849946022034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22855022549629211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22761499881744385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22558918595314026},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.19065600633621216},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.18132859468460083},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0207001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207001","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":4,"referenced_works":["https://openalex.org/W2042312329","https://openalex.org/W2043862089","https://openalex.org/W2067297441","https://openalex.org/W2104680817"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W4255148175","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2971368033","https://openalex.org/W2949755993","https://openalex.org/W2967935725","https://openalex.org/W1590563747"],"abstract_inverted_index":{"Related":[0],"DatabasesWeb":[1],"of":[2],"Science":[3],"You":[4],"must":[5],"be":[6],"logged":[7],"in":[8],"with":[9],"an":[10],"active":[11],"subscription":[12],"to":[13],"view":[14],"this.Article":[15],"DataHistorySubmitted:":[16],"28":[17],"September":[18],"1976Published":[19],"online:":[20],"13":[21],"July":[22],"2006Keywordsbin":[23],"packing,":[24],"multiprocessor":[25],"scheduling,":[26],"approximation":[27],"algorithms,":[28],"worst-case":[29],"analysis,":[30],"performance":[31],"boundsPublication":[32],"DataISSN":[33],"(print):":[34],"0097-5397ISSN":[35],"(online):":[36],"1095-7111Publisher:":[37],"Society":[38],"for":[39],"Industrial":[40],"and":[41],"Applied":[42],"MathematicsCODEN:":[43],"smjcat":[44]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":30}],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2025-10-10T00:00:00"}