{"id":"https://openalex.org/W2154305205","doi":"https://doi.org/10.1137/0204015","title":"Bounds for Multiprocessor Scheduling with Resource Constraints","display_name":"Bounds for Multiprocessor Scheduling with Resource Constraints","publication_year":1975,"publication_date":"1975-06-01","ids":{"openalex":"https://openalex.org/W2154305205","doi":"https://doi.org/10.1137/0204015","mag":"2154305205"},"language":"en","primary_location":{"id":"doi:10.1137/0204015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204015","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/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071015671","display_name":"Ron Graham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. L. Graham","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047995033"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.5604,"has_fulltext":false,"cited_by_count":244,"citation_normalized_percentile":{"value":0.98544699,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"4","issue":"2","first_page":"187","last_page":"200"},"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.9902999997138977,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8453335762023926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7832977175712585},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6646314859390259},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6140649914741516},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.56717449426651},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.5480157136917114},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4864211082458496},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4727894961833954},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4516221880912781},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4320376515388489},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4212988317012787},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41827940940856934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37648969888687134},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.33226239681243896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28351321816444397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22900637984275818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19580590724945068},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.17830607295036316},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10010665655136108},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.09886571764945984},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07967829704284668},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06921806931495667},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0685659646987915}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.8453335762023926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7832977175712585},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6646314859390259},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6140649914741516},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.56717449426651},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.5480157136917114},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4864211082458496},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4727894961833954},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4516221880912781},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4320376515388489},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4212988317012787},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41827940940856934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37648969888687134},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33226239681243896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28351321816444397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22900637984275818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19580590724945068},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.17830607295036316},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10010665655136108},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.09886571764945984},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07967829704284668},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06921806931495667},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0685659646987915},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0204015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204015","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.4205","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.4205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucsd.edu/~sbutler/ron/75_04_multiprocessor.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1973538756","https://openalex.org/W2014404405","https://openalex.org/W2020299050","https://openalex.org/W2027077493","https://openalex.org/W2046063196","https://openalex.org/W2092333800","https://openalex.org/W2104680817","https://openalex.org/W2182823773","https://openalex.org/W2218553884","https://openalex.org/W2401610261","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2101964286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221"],"abstract_inverted_index":{"One":[0],"well-studied":[1],"model":[2,102],"of":[3,12,19,29,55,65,98,107,110,122,128,147],"a":[4,8,16,26,33,74,108],"multiprocessing":[5],"system":[6,57],"involves":[7],"fixed":[9],"number":[10],"n":[11],"identical":[13],"abstract":[14],"processors,":[15],"finite":[17],"set":[18,109],"tasks":[20,38,42],"to":[21,43,69,161],"be":[22,44,50,91],"executed,":[23],"each":[24,117],"requiring":[25],"specified":[27],"amount":[28],"computation":[30],"time,":[31],"and":[32,156,158],"partial":[34],"ordering":[35],"on":[36,86,144],"the":[37,56,66,70,82,105,113,119,145,164],"which":[39,88],"requires":[40],"certain":[41,47],"completed":[45],"before":[46],"others":[48],"can":[49],"initiated.":[51],"The":[52],"nonpreemptive":[53],"operation":[54],"is":[58],"guided":[59],"by":[60,103],"an":[61,95],"ordered":[62],"list":[63],"L":[64,87,155],"tasks,":[67],"according":[68],"rule":[71],"that":[72,115,123,163],"whenever":[73],"processor":[75],"becomes":[76],"idle,":[77],"it":[78],"selects":[79],"for":[80,116],"processing":[81],"first":[83],"unexecuted":[84],"task":[85],"may":[89,130],"validly":[90],"executed.":[92],"We":[93],"introduce":[94],"additional":[96],"element":[97],"realism":[99],"into":[100],"this":[101,137],"postulating":[104],"existence":[106],"\u201cresources\u201d":[111],"with":[112],"property":[114],"resource,":[118],"total":[120,134],"usage":[121],"resource":[124],"at":[125],"any":[126],"instant":[127],"time":[129],"not":[131],"exceed":[132],"its":[133],"availability.":[135],"For":[136],"augmented":[138],"model,":[139],"we":[140],"determine":[141],"upper":[142],"bounds":[143,165],"ratio":[146],"finishing":[148],"times":[149],"achieved":[150],"using":[151],"two":[152],"different":[153],"lists,":[154],"$L'$,":[157],"exhibit":[159],"constructions":[160],"show":[162],"are":[166],"best":[167],"possible.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}