{"id":"https://openalex.org/W2967169162","doi":"https://doi.org/10.1145/3342562","title":"Scheduling Mutual Exclusion Accesses in Equal-Length Jobs","display_name":"Scheduling Mutual Exclusion Accesses in Equal-Length Jobs","publication_year":2019,"publication_date":"2019-06-30","ids":{"openalex":"https://openalex.org/W2967169162","doi":"https://doi.org/10.1145/3342562","mag":"2967169162"},"language":"en","primary_location":{"id":"doi:10.1145/3342562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3342562","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel 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/A5009349080","display_name":"Dimitri Kagaris","orcid":"https://orcid.org/0000-0003-2061-5080"},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitri Kagaris","raw_affiliation_strings":["Southern Illinois University, Carbondale, IL"],"affiliations":[{"raw_affiliation_string":"Southern Illinois University, Carbondale, IL","institution_ids":["https://openalex.org/I110378019"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042216395","display_name":"Sourav Dutta","orcid":"https://orcid.org/0000-0002-8799-9237"},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sourav Dutta","raw_affiliation_strings":["Southern Illinois University, Carbondale, IL"],"affiliations":[{"raw_affiliation_string":"Southern Illinois University, Carbondale, IL","institution_ids":["https://openalex.org/I110378019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009349080"],"corresponding_institution_ids":["https://openalex.org/I110378019"],"apc_list":null,"apc_paid":null,"fwci":0.2175,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61130579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"26"},"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.9988999962806702,"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.9970999956130981,"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.7922532558441162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6619510054588318},{"id":"https://openalex.org/keywords/serialization","display_name":"Serialization","score":0.5602899789810181},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5365882515907288},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48387253284454346},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45823433995246887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4385640025138855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41900634765625},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41599082946777344},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41396060585975647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3413654863834381}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7922532558441162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6619510054588318},{"id":"https://openalex.org/C52723943","wikidata":"https://www.wikidata.org/wiki/Q1127410","display_name":"Serialization","level":2,"score":0.5602899789810181},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5365882515907288},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48387253284454346},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45823433995246887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4385640025138855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41900634765625},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41599082946777344},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41396060585975647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3413654863834381},{"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.1145/3342562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3342562","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W562333372","https://openalex.org/W964861289","https://openalex.org/W1488422606","https://openalex.org/W1555410326","https://openalex.org/W1963774625","https://openalex.org/W1965062603","https://openalex.org/W1967955864","https://openalex.org/W1971610650","https://openalex.org/W1984229638","https://openalex.org/W1986096063","https://openalex.org/W2001080175","https://openalex.org/W2007315235","https://openalex.org/W2024742034","https://openalex.org/W2095381673","https://openalex.org/W2101946201","https://openalex.org/W2117377736","https://openalex.org/W2122827876","https://openalex.org/W2135507920","https://openalex.org/W2143293078","https://openalex.org/W2157529519","https://openalex.org/W2159506517","https://openalex.org/W2164348333","https://openalex.org/W2316339787","https://openalex.org/W2340365916","https://openalex.org/W2542898112","https://openalex.org/W2743045177","https://openalex.org/W2808376720","https://openalex.org/W3145128584","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W4231356583","https://openalex.org/W1593760324","https://openalex.org/W2899905671","https://openalex.org/W2376159383","https://openalex.org/W2351439380","https://openalex.org/W4390136247","https://openalex.org/W2365228680","https://openalex.org/W2131622620","https://openalex.org/W1966261337","https://openalex.org/W1581805909"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"problem":[2,32,127,251],"in":[3],"parallel":[4],"and":[5,56,78,100,160,222,271],"distributed":[6],"processing":[7],"is":[8,13,138],"the":[9,17,31,49,80,92,107,114,126,143,148,241,249,283],"partial":[10],"serialization":[11],"that":[12,125],"imposed":[14],"due":[15],"to":[16,23,87,142,237],"need":[18],"for":[19,95,101,106,118,147,248],"mutually":[20],"exclusive":[21],"access":[22],"common":[24],"resources.":[25],"In":[26,113],"this":[27,122],"article,":[28],"we":[29,266],"investigate":[30],"of":[33,38,42,48,53,68,82,98,104,109],"optimally":[34],"scheduling":[35,120],"(in":[36],"terms":[37],"makespan)":[39],"a":[40,65,72,83,89,268],"set":[41,67],"jobs,":[43],"where":[44],"each":[45,57],"job":[46],"consists":[47],"same":[50],"number":[51,97,103],"L":[52,110,244,260],"unit-duration":[54],"tasks,":[55],"task":[58],"either":[59],"accesses":[60,71],"exclusively":[61],"one":[62],"resource":[63],"from":[64],"given":[66],"resources":[69,105],"or":[70],"fully":[73],"shareable":[74],"resource.":[75],"We":[76],"develop":[77],"establish":[79],"optimality":[81],"fast":[84],"polynomial-time":[85],"algorithm":[86],"find":[88],"schedule":[90],"with":[91,275,282],"shortest":[93],"makespan":[94],"any":[96,102],"jobs":[99],"case":[108,243],"=":[111,166,259],"2.":[112],"notation":[115],"commonly":[116],"used":[117],"job-shop":[119,250],"problems,":[121],"result":[123],"means":[124],"J":[128,150,161,178,189,201,212,223,252],"|":[129,152,157,163,168,180,185,191,197,203,208,214,218,224,253],"d":[130,164,192,215,225,254],"ij":[131,165,193,216,226,255],"=1,":[132,227,256],"n":[133,153,181,204,228,257],"j":[134,154,182,205,229,258],"=2|":[135],"C":[136,158,169,186,198,209,219,232,263],"max":[137,159,170,187,199,210,220,233,264],"polynomially":[139],"solvable,":[140],"adding":[141],"polynomial":[144],"solutions":[145],"known":[146,236],"problems":[149],"2":[151,156,162,179,190,207,246],"\u2264":[155,183,206,230],"1":[167],"(whereas":[171],"other":[172,276],"closely":[173],"related":[174],"versions":[175,278],"such":[176],"as":[177],"3":[184,202,213],",":[188,200,211,221],"\u2208":[194],"{":[195],"1,2}":[196],"=1":[217],"3|":[231],"are":[234],"all":[235],"be":[238],"NP-complete).":[239],"For":[240],"general":[242],">":[245,261],"(i.e.,":[247],"2|":[262],"),":[265],"present":[267],"competitive":[269],"heuristic":[270,277],"provide":[272],"experimental":[273],"comparisons":[274],"and,":[279],"when":[280],"possible,":[281],"ideal":[284],"integer":[285],"linear":[286],"programming":[287],"formulation.":[288]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}