{"id":"https://openalex.org/W2774020495","doi":"https://doi.org/10.1109/soli.2017.8120966","title":"Genetic algorithms hybridized with the self controlling dominance to solve a multi-objective resource constraint project scheduling problem","display_name":"Genetic algorithms hybridized with the self controlling dominance to solve a multi-objective resource constraint project scheduling problem","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2774020495","doi":"https://doi.org/10.1109/soli.2017.8120966","mag":"2774020495"},"language":"en","primary_location":{"id":"doi:10.1109/soli.2017.8120966","is_oa":false,"landing_page_url":"https://doi.org/10.1109/soli.2017.8120966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","raw_type":"proceedings-article"},"type":"preprint","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/A5105207569","display_name":"Xixi Wang","orcid":"https://orcid.org/0000-0001-6318-2591"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xixi Wang","raw_affiliation_strings":["ICD-LOSI, University of Technology of Troyes, FRANCE","Laboratoire d'Optimisation des Syst\u00e8mes Industriels"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICD-LOSI, University of Technology of Troyes, FRANCE","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"Laboratoire d'Optimisation des Syst\u00e8mes Industriels","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079174269","display_name":"Farouk Yalaoui","orcid":"https://orcid.org/0000-0001-7360-2932"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Farouk Yalaoui","raw_affiliation_strings":["ICD-LOSI, University of Technology of Troyes, FRANCE","Laboratoire d'Optimisation des Syst\u00e8mes Industriels"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICD-LOSI, University of Technology of Troyes, FRANCE","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"Laboratoire d'Optimisation des Syst\u00e8mes Industriels","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084029949","display_name":"Fr\u00e9d\u00e9ric Dugardin","orcid":"https://orcid.org/0000-0001-5401-4537"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frederic Dugardin","raw_affiliation_strings":["ICD-LOSI, University of Technology of Troyes, FRANCE","Laboratoire d'Optimisation des Syst\u00e8mes Industriels"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICD-LOSI, University of Technology of Troyes, FRANCE","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"Laboratoire d'Optimisation des Syst\u00e8mes Industriels","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.21400051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.871399462223053},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7053457498550415},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6862973570823669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6166134476661682},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5893263220787048},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5398826003074646},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5247535705566406},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4920177161693573},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4906391203403473},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4887197017669678},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.47492605447769165},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4528149962425232},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.44273698329925537},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3377078175544739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2400341033935547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21870556473731995},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06879410147666931}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.871399462223053},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7053457498550415},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6862973570823669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6166134476661682},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5893263220787048},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5398826003074646},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5247535705566406},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4920177161693573},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4906391203403473},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4887197017669678},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.47492605447769165},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4528149962425232},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.44273698329925537},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3377078175544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2400341033935547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21870556473731995},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06879410147666931},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/soli.2017.8120966","is_oa":false,"landing_page_url":"https://doi.org/10.1109/soli.2017.8120966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02611081v1","is_oa":false,"landing_page_url":"https://utt.hal.science/hal-02611081","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":"2017 IEEE International Conference on Service Operations and Logistics and Informatics (SOLI), Sep 2017, Bari, Italy. pp.39-44, ⟨10.1109/SOLI.2017.8120966⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"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":19,"referenced_works":["https://openalex.org/W51490203","https://openalex.org/W774684742","https://openalex.org/W1483470150","https://openalex.org/W1972360116","https://openalex.org/W1973131489","https://openalex.org/W1993810343","https://openalex.org/W2007363252","https://openalex.org/W2022485595","https://openalex.org/W2022632482","https://openalex.org/W2024742034","https://openalex.org/W2036112575","https://openalex.org/W2081990930","https://openalex.org/W2089055270","https://openalex.org/W2090567473","https://openalex.org/W2098907614","https://openalex.org/W2126105956","https://openalex.org/W2172293207","https://openalex.org/W2512181256","https://openalex.org/W2766724133"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2014988816","https://openalex.org/W2031602517","https://openalex.org/W1963790170","https://openalex.org/W2001575782","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682"],"abstract_inverted_index":{"The":[0,169],"Resource":[1],"Constraint":[2],"Project":[3],"Scheduling":[4],"Problem":[5],"(RCPSP)":[6],"is":[7,34,151],"one":[8],"of":[9,54,63,113,142,166],"the":[10,17,21,27,35,55,57,64,95,108,155,158,164,173],"most":[11],"challenged":[12],"scheduling":[13,19],"topics.":[14],"Compared":[15],"to":[16,26,41,80,162],"other":[18],"problems,":[20],"RCPSP":[22,51],"pays":[23],"special":[24],"attention":[25],"consumable":[28],"resources":[29,145],"with":[30,52,126],"limited":[31],"capacities,":[32],"which":[33],"major":[36],"issue":[37],"that":[38],"industry":[39],"has":[40],"cope":[42],"with.":[43],"In":[44,85],"our":[45,106,117],"study,":[46,107],"we":[47,102],"tackle":[48],"a":[49],"Multi-Objective":[50],"minimization":[53],"makespan,":[56],"total":[58],"job":[59],"tardiness":[60],"and":[61,74,124,134,144,157],"maximization":[62],"workload":[65],"balance":[66],"level.":[67],"Non-dominated":[68],"Sorting":[69],"Genetic":[70],"Algorithm":[71],"II":[72],"(NSGAII)":[73],"NSGAIII":[75],"are":[76,146,160,175],"applied":[77],"at":[78],"first":[79],"find":[81,119],"approximated":[82],"Pareto":[83,97,122],"fronts.":[84],"particular":[86],"circumstances,":[87],"decision":[88],"makers":[89],"would":[90],"prefer":[91],"preselected":[92],"propositions":[93],"than":[94],"whole":[96],"front.":[98],"For":[99],"this":[100],"reason,":[101],"have":[103],"integrated":[104],"in":[105,116],"Self":[109],"Controlling":[110],"Dominance":[111],"Area":[112],"Solutions":[114],"(SCDAS)":[115],"algorithms":[118],"more":[120],"fine-grained":[121],"fronts,":[123],"solutions":[125],"good":[127],"qualities":[128],"on":[129],"all":[130],"objectives.":[131],"Small,":[132],"medium":[133],"large":[135],"size":[136],"instances,":[137],"featured":[138],"by":[139,172],"different":[140,167],"parameters":[141],"jobs":[143],"tested.":[147],"A":[148],"comparative":[149],"study":[150],"carried":[152],"out":[153],"where":[154],"hypervolume":[156],"metric-C":[159],"used":[161],"evaluate":[163],"performances":[165],"methods.":[168],"improvements":[170],"brought":[171],"SCDAS":[174],"proved":[176],"regarding":[177],"both":[178],"metrics.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}