{"id":"https://openalex.org/W7161163963","doi":"https://doi.org/10.1016/j.eswa.2026.132784","title":"NEAR: A preference-driven multi-objective evolutionary algorithm based on the Choquet integral for single-machine scheduling with sequence-dependent setup times","display_name":"NEAR: A preference-driven multi-objective evolutionary algorithm based on the Choquet integral for single-machine scheduling with sequence-dependent setup times","publication_year":2026,"publication_date":"2026-05-14","ids":{"openalex":"https://openalex.org/W7161163963","doi":"https://doi.org/10.1016/j.eswa.2026.132784"},"language":"en","primary_location":{"id":"doi:10.1016/j.eswa.2026.132784","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.eswa.2026.132784","pdf_url":null,"source":{"id":"https://openalex.org/S13144211","display_name":"Expert Systems with Applications","issn_l":"0957-4174","issn":["0957-4174","1873-6793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Expert Systems with Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.eswa.2026.132784","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090324318","display_name":"Andreas C. Nearchou","orcid":"https://orcid.org/0000-0002-5525-8661"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Andreas C. Nearchou","raw_affiliation_strings":["Department of Business Administration, University of Patras 26 500 Patras, Greece"],"raw_orcid":"https://orcid.org/0000-0002-5525-8661","affiliations":[{"raw_affiliation_string":"Department of Business Administration, University of Patras 26 500 Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090324318"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":{"value":3500,"currency":"USD","value_usd":3500},"apc_paid":{"value":3500,"currency":"USD","value_usd":3500},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4359385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"326","issue":null,"first_page":"132784","last_page":"132784"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9083999991416931,"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.9083999991416931,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.014999999664723873,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.014499999582767487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/tardiness","display_name":"Tardiness","score":0.8367999792098999},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.626800000667572},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5764999985694885},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5587000250816345},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4977000057697296},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.43230000138282776},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3926999866962433}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8367999792098999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7235999703407288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7102000117301941},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.626800000667572},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5764999985694885},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5587000250816345},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.44020000100135803},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.3124000132083893},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2646999955177307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2542000114917755},{"id":"https://openalex.org/C112799922","wikidata":"https://www.wikidata.org/wiki/Q5104911","display_name":"Choquet integral","level":3,"score":0.2540000081062317},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.eswa.2026.132784","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.eswa.2026.132784","pdf_url":null,"source":{"id":"https://openalex.org/S13144211","display_name":"Expert Systems with Applications","issn_l":"0957-4174","issn":["0957-4174","1873-6793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Expert Systems with Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.eswa.2026.132784","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.eswa.2026.132784","pdf_url":null,"source":{"id":"https://openalex.org/S13144211","display_name":"Expert Systems with Applications","issn_l":"0957-4174","issn":["0957-4174","1873-6793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Expert Systems with Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W1488422606","https://openalex.org/W1588375755","https://openalex.org/W1638001288","https://openalex.org/W1957430778","https://openalex.org/W1968795611","https://openalex.org/W1968972013","https://openalex.org/W1973614995","https://openalex.org/W1978778741","https://openalex.org/W1981475023","https://openalex.org/W1993362995","https://openalex.org/W1997425713","https://openalex.org/W2002721920","https://openalex.org/W2002815701","https://openalex.org/W2008440605","https://openalex.org/W2014801003","https://openalex.org/W2021659413","https://openalex.org/W2022485595","https://openalex.org/W2030412460","https://openalex.org/W2030448042","https://openalex.org/W2030466934","https://openalex.org/W2034116395","https://openalex.org/W2038420231","https://openalex.org/W2041102680","https://openalex.org/W2045831866","https://openalex.org/W2051115145","https://openalex.org/W2055387365","https://openalex.org/W2056624909","https://openalex.org/W2064816527","https://openalex.org/W2067613981","https://openalex.org/W2087753833","https://openalex.org/W2087875896","https://openalex.org/W2088303050","https://openalex.org/W2098073550","https://openalex.org/W2107072968","https://openalex.org/W2108968575","https://openalex.org/W2123808725","https://openalex.org/W2124466170","https://openalex.org/W2126105956","https://openalex.org/W2128250282","https://openalex.org/W2133863446","https://openalex.org/W2143381319","https://openalex.org/W2146219471","https://openalex.org/W2147926599","https://openalex.org/W2157793635","https://openalex.org/W2161819088","https://openalex.org/W2168623380","https://openalex.org/W2647153655","https://openalex.org/W2743045177","https://openalex.org/W2784132163","https://openalex.org/W2803760160","https://openalex.org/W2921090891","https://openalex.org/W2963421337","https://openalex.org/W2997776631","https://openalex.org/W3006186968","https://openalex.org/W3011855308","https://openalex.org/W3105444733","https://openalex.org/W4401116189","https://openalex.org/W4401827999","https://openalex.org/W4403413043","https://openalex.org/W4407260970","https://openalex.org/W4407511234","https://openalex.org/W4407568003","https://openalex.org/W4407599132","https://openalex.org/W4409290314","https://openalex.org/W4409921522","https://openalex.org/W4411635315","https://openalex.org/W4412505047","https://openalex.org/W4413751775","https://openalex.org/W4415296756"],"related_works":[],"abstract_inverted_index":{"Multi-objective":[0],"scheduling":[1,119],"problems":[2],"with":[3,33,71,121,164,172],"sequence-dependent":[4],"setup":[5],"times":[6],"(SDST)":[7],"arise":[8],"in":[9],"several":[10],"real-world":[11],"production":[12],"environments":[13],"and":[14,25,54,106,111,134,170,180,186],"are":[15,51],"characterized":[16],"by":[17,59],"conflicting":[18],"performance":[19,200],"criteria,":[20],"complex":[21],"interdependencies":[22],"among":[23,104],"decisions":[24],"a":[26,74,145],"combinatorial":[27],"search":[28],"space":[29],"that":[30,80,149,195],"grows":[31],"rapidly":[32],"problem":[34,120],"size.":[35],"These":[36],"characteristics":[37],"make":[38],"the":[39,87,93,100,117,124,184,189],"design":[40],"of":[41,95,102,127,188],"effective":[42],"decision-support":[43],"tools":[44],"particularly":[45],"challenging,":[46],"especially":[47],"when":[48],"decision-maker":[49],"preferences":[50],"not":[52],"additive":[53],"cannot":[55],"be":[56],"easily":[57],"captured":[58],"conventional":[60],"scalarization":[61],"approaches.":[62],"This":[63],"paper":[64],"proposes":[65],"NEAR":[66,113,143,196],"(the":[67],"Non-dominated":[68],"Evolutionary":[69],"Algorithm":[70],"preference":[72,84,97,152,207],"Relations),":[73],"novel":[75],"multi-objective":[76,174],"optimization":[77],"(MOO)":[78],"algorithm":[79],"integrates":[81],"Choquet":[82],"Integral-based":[83],"aggregation":[85],"into":[86],"MOO":[88],"process.":[89],"The":[90],"method":[91],"enables":[92],"incorporation":[94],"non-additive":[96],"structures,":[98],"allowing":[99],"modeling":[101],"interactions":[103],"objectives":[105],"supporting":[107],"preference-guided":[108,140],"solution":[109],"selection":[110],"variation.":[112],"is":[114],"applied":[115],"to":[116,139,166],"single-machine":[118],"SDST,":[122],"considering":[123],"simultaneous":[125],"minimization":[126],"total":[128],"weighted":[129],"tardiness":[130,133],",":[131],"maximum":[132],"makespan":[135],".":[136],"In":[137],"addition":[138],"environmental":[141],"selection,":[142],"introduces":[144],"Choquet-based":[146],"crossover":[147],"mechanism":[148],"exploits":[150],"aggregated":[151],"information":[153],"during":[154],"offspring":[155],"generation.":[156],"An":[157],"extensive":[158],"computational":[159],"study,":[160],"including":[161],"sensitivity":[162],"analysis":[163,193],"respect":[165],"different":[167],"fuzzy-measure":[168],"configurations":[169],"comparisons":[171],"representative":[173],"evolutionary":[175],"algorithms":[176],"(including":[177],"preference-based,":[178],"indicator-based":[179],"decomposition-based":[181],"methods),":[182],"demonstrates":[183],"robustness":[185],"competitiveness":[187],"proposed":[190],"approach.":[191],"Statistical":[192],"confirms":[194],"achieves":[197],"consistent":[198],"convergence":[199],"while":[201],"maintaining":[202],"satisfactory":[203],"diversity":[204],"under":[205],"varying":[206],"structures.":[208]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-05-15T00:00:00"}