{"id":"https://openalex.org/W2005676724","doi":"https://doi.org/10.1051/ro/2014005","title":"Solving multi-agent scheduling problems on parallel machines with a global objective function","display_name":"Solving multi-agent scheduling problems on parallel machines with a global objective function","publication_year":2014,"publication_date":"2014-03-07","ids":{"openalex":"https://openalex.org/W2005676724","doi":"https://doi.org/10.1051/ro/2014005","mag":"2005676724"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2014005","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2014005","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","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/A5056157687","display_name":"F. Sadi","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"F. Sadi","raw_affiliation_strings":["Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059776090","display_name":"Ameur Soukhal","orcid":"https://orcid.org/0000-0002-4668-823X"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Soukhal","raw_affiliation_strings":["Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108073087","display_name":"Jean\u2010Charles Billaut","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J.-C. Billaut","raw_affiliation_strings":["Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9Fran\u00e7ois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056157687"],"corresponding_institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"],"apc_list":null,"apc_paid":null,"fwci":1.8726,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86572947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"48","issue":"2","first_page":"255","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7068406343460083},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5340188145637512},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48091933131217957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4520915448665619},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36314210295677185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20789578557014465}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7068406343460083},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5340188145637512},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48091933131217957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4520915448665619},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36314210295677185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20789578557014465}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2014005","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2014005","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01004026v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01004026","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RAIRO - Operations Research, 2014, 48 (2), pp.255-269. ⟨10.1051/ro/2014005⟩","raw_type":"Journal articles"},{"id":"pmh:oai:numdam.org:RO_2014__48_2_255_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2014005/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W42525944","https://openalex.org/W1488422606","https://openalex.org/W1968576434","https://openalex.org/W1971501294","https://openalex.org/W1980489469","https://openalex.org/W1993080431","https://openalex.org/W1997032351","https://openalex.org/W1999212072","https://openalex.org/W2000809807","https://openalex.org/W2006820870","https://openalex.org/W2008118316","https://openalex.org/W2024848424","https://openalex.org/W2033747918","https://openalex.org/W2048216313","https://openalex.org/W2072152357","https://openalex.org/W2074320981","https://openalex.org/W2084819354","https://openalex.org/W2091376812","https://openalex.org/W2100292670","https://openalex.org/W2106547697","https://openalex.org/W2115299891","https://openalex.org/W2144698987","https://openalex.org/W2155047985","https://openalex.org/W2157529519","https://openalex.org/W2165852962","https://openalex.org/W2469281712","https://openalex.org/W4239337465"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"In":[0,103],"this":[1,104],"study,":[2,105],"we":[3,106,121,144],"consider":[4,107],"a":[5,51,55,73,78,94,99,123,129],"scheduling":[6,96],"environment":[7],"with":[8,32,98,110],"m(m":[9],"\u2265":[10],"1)":[11],"parallel":[12,136],"machines.":[13],"The":[14,35,46],"set":[15],"of":[16,28,67],"jobs":[17,29,42],"to":[18,39,49],"schedule":[19,52],"is":[20,30,48,93,119,141],"divided":[21],"into":[22],"K":[23,36],"disjoint":[24],"subsets.":[25],"Each":[26],"subset":[27],"associated":[31],"one":[33],"agent.":[34],"agents":[37],"compete":[38],"perform":[40],"their":[41],"on":[43,128],"common":[44],"resources.":[45],"objective":[47,57,65,101],"find":[50],"that":[53],"minimizes":[54],"global":[56,100],"function":[58,66],"f":[59,70],"0,":[60,88],"while":[61],"maintaining":[62],"the":[63,108,113,134],"regular":[64],"each":[68],"agent,":[69],"k,":[71],"at":[72],"level":[74],"no":[75],"greater":[76],"than":[77],"fixed":[79],"value,":[80],"\u03b5k":[81],"(fk":[82],"\u2208":[83],"{fkmax,":[84],"\u2211fk},":[85],"k":[86],"=":[87],"...,":[89],"K).":[90],"This":[91],"problem":[92,97],"multi-agent":[95],"function.":[102],"case":[109,114],"preemption":[111,118,140],"and":[112,150],"without":[115],"preemption.":[116],"If":[117,139],"allowed,":[120,143],"propose":[122,145],"polynomial":[124],"time":[125],"algorithm":[126],"based":[127],"network":[130],"flow":[131],"approach":[132],"for":[133],"unrelated":[135],"machine":[137],"case.":[138],"not":[142],"some":[146],"general":[147],"complexity":[148],"results":[149],"develop":[151],"dynamic":[152],"programming":[153],"algorithms.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}