{"id":"https://openalex.org/W4285190903","doi":"https://doi.org/10.1109/tase.2022.3181530","title":"Equitable Allocation of Operations and Makespan Minimization for Autonomous Agents","display_name":"Equitable Allocation of Operations and Makespan Minimization for Autonomous Agents","publication_year":2022,"publication_date":"2022-06-13","ids":{"openalex":"https://openalex.org/W4285190903","doi":"https://doi.org/10.1109/tase.2022.3181530"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3181530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3181530","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","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/A5069077057","display_name":"Raunak Sengupta","orcid":"https://orcid.org/0000-0002-5381-8733"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Raunak Sengupta","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084546619","display_name":"Rakesh Nagi","orcid":"https://orcid.org/0000-0003-4022-6277"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rakesh Nagi","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006769834","display_name":"R.S. Sreenivas","orcid":"https://orcid.org/0000-0002-8242-0839"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramavarapu S. Sreenivas","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069077057"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.6546,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7115559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"1","first_page":"703","last_page":"717"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8434346914291382},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7074517011642456},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6710104942321777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5295083522796631},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.48025110363960266},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.47773808240890503},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4764968752861023},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4416191577911377},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4242563843727112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3612232506275177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2987760305404663},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.18199121952056885},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11945304274559021}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8434346914291382},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7074517011642456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6710104942321777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5295083522796631},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.48025110363960266},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.47773808240890503},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4764968752861023},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4416191577911377},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4242563843727112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3612232506275177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2987760305404663},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.18199121952056885},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11945304274559021},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2022.3181530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3181530","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1519208554","https://openalex.org/W1965349277","https://openalex.org/W1999445878","https://openalex.org/W2014071862","https://openalex.org/W2015558981","https://openalex.org/W2038401118","https://openalex.org/W2046825771","https://openalex.org/W2052586468","https://openalex.org/W2079854492","https://openalex.org/W2113257089","https://openalex.org/W2139215077","https://openalex.org/W2142508241","https://openalex.org/W2142544818","https://openalex.org/W2144827113","https://openalex.org/W2150409561","https://openalex.org/W2157488300","https://openalex.org/W2166103243","https://openalex.org/W2207287321","https://openalex.org/W2738128330","https://openalex.org/W2738447207","https://openalex.org/W2966853508","https://openalex.org/W3011924088","https://openalex.org/W3037262835","https://openalex.org/W4230883182","https://openalex.org/W4256264166","https://openalex.org/W6630605703","https://openalex.org/W6671060741","https://openalex.org/W6774805843"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W4206466499","https://openalex.org/W2970302286","https://openalex.org/W4213379045","https://openalex.org/W2810352541","https://openalex.org/W3190401582","https://openalex.org/W2162001022","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W2142195909"],"abstract_inverted_index":{"We":[0,27,78],"study":[1],"the":[2,25,30,38,57,70,85,115,125,135,143,149,156,162,173,178,181,193,228,240],"problem":[3],"of":[4,8,14,54,73,84,122,151,180,215,239],"allocating":[5],"a":[6,12,17,81,247,266,273],"set":[7,13],"indivisible":[9],"operations":[10],"to":[11,43,102,138,160,199,254,280],"agents":[15],"in":[16,66,183,246,265,269],"fair":[18],"and":[19,76,282],"efficient":[20],"manner":[21,249,268],"while":[22,48],"also":[23,49,117,262],"minimizing":[24,227],"makespan.":[26,174],"first":[28,157],"present":[29],"Operation":[31],"Trading":[32],"Algorithm":[33],"that":[34,114,205,221],"generates":[35],"allocations":[36,185,220],"satisfying":[37],"DEQx":[39],"(Duplicated":[40,87],"Equitability":[41,88],"up":[42],"any":[44,213],"operation)":[45,91],"fairness":[46,92,164,223],"criterion":[47,93],"guaranteeing":[50],"an":[51,119],"upper":[52,120,136,146,170],"bound":[53,121,137],"2":[55,128],"on":[56,124,172,195],"makespan":[58,126],"for":[59,127,209],"identical":[60],"agents.":[61,130,216],"The":[62,166,217,259],"pairwise":[63],"approach":[64],"used":[65,208],"this":[67],"algorithm":[68,99,116],"has":[69],"added":[71],"advantages":[72],"being":[74],"decentralizable":[75],"robust.":[77],"then":[79],"define":[80],"relaxed":[82],"version":[83],"DEQ1":[86],"upto":[89],"some":[90,238],"called":[94],"partial-DEQ1.":[95],"A":[96],"market":[97],"based":[98],"is":[100,112,141,277],"presented":[101],"achieve":[103,161],"partial-DEQ1":[104],"along":[105,225],"with":[106,186,226,256],"Pareto":[107],"Optimality.":[108],"Following":[109],"this,":[110],"it":[111,252],"shown":[113],"guarantees":[118],"1.618":[123],"non-identical":[129],"Parametric":[131],"Pruning":[132],"further":[133],"improves":[134],"1.5":[139],"which":[140],"theoretically":[142],"best":[144,150],"possible":[145],"bound.":[147],"To":[148],"our":[152],"knowledge,":[153],"these":[154],"are":[155],"algorithms":[158,167,182,194,204,218,241,260],"designed":[159],"mentioned":[163],"criteria.":[165],"additionally":[168],"guarantee":[169],"bounds":[171],"Finally,":[175],"we":[176],"show":[177],"efficacy":[179],"generating":[184],"near":[187],"optimal":[188],"makespans":[189],"by":[190],"numerically":[191],"evaluating":[192],"random":[196],"instances.":[197],"Note":[198],"Practitioners\u2014This":[200],"paper":[201],"provides":[202],"fast":[203],"can":[206,243,261],"be":[207,244,263],"task":[210],"allocation":[211],"among":[212],"number":[214],"generate":[219],"satisfy":[222],"criteria":[224,235],"makespan,":[229],"thus":[230,250],"achieving":[231],"two":[232],"practically":[233],"important":[234],"simultaneously.":[236],"Additionally,":[237],"introduced":[242],"implemented":[245,264],"reactive":[248],"making":[251],"easy":[253],"deal":[255],"sudden":[257],"changes.":[258],"decentralized":[267],"environments":[270],"where":[271],"maintaining":[272],"centralized":[274],"situational":[275],"awareness":[276],"difficult":[278],"due":[279],"communication":[281],"machine":[283],"failures.":[284]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}