{"id":"https://openalex.org/W2084062883","doi":"https://doi.org/10.1109/cec.2009.4982983","title":"A self-guided genetic algorithm for flowshop scheduling problems","display_name":"A self-guided genetic algorithm for flowshop scheduling problems","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2084062883","doi":"https://doi.org/10.1109/cec.2009.4982983","mag":"2084062883"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4982983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4982983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5103551205","display_name":"S-H Chen","orcid":"https://orcid.org/0000-0002-0554-4643"},"institutions":[{"id":"https://openalex.org/I91935597","display_name":"University of South China","ror":"https://ror.org/03mqfn238","country_code":"CN","type":"education","lineage":["https://openalex.org/I91935597"]},{"id":"https://openalex.org/I4210112569","display_name":"Nanhua University","ror":"https://ror.org/01tfbz441","country_code":"TW","type":"education","lineage":["https://openalex.org/I4210112569"]}],"countries":["CN","TW"],"is_corresponding":true,"raw_author_name":"Shih Hsin Chen","raw_affiliation_strings":["Department of Electronic Commerce Management, Nanhua University, Dalin, Taiwan","[Department of Electronic Commerce Management, Nanhua University. No.32, Chungkeng, Dalin, Chiayi 62248, Taiwan, R.O.C.]"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Commerce Management, Nanhua University, Dalin, Taiwan","institution_ids":["https://openalex.org/I4210112569"]},{"raw_affiliation_string":"[Department of Electronic Commerce Management, Nanhua University. No.32, Chungkeng, Dalin, Chiayi 62248, Taiwan, R.O.C.]","institution_ids":["https://openalex.org/I91935597"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070519744","display_name":"Pei\u2010Chann Chang","orcid":"https://orcid.org/0000-0002-9900-3513"},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Pei Chann Chang","raw_affiliation_strings":["Department of Information Management, Yuan-Ze University, Taoyuan, Taiwan","Department of Information Management, Yuan-Ze University. 135 Yuan-Dong Rd., Taoyuan 32026, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, Yuan-Ze University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I99908691"]},{"raw_affiliation_string":"Department of Information Management, Yuan-Ze University. 135 Yuan-Dong Rd., Taoyuan 32026, Taiwan, R.O.C","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000546219","display_name":"Qingfu Zhang","orcid":"https://orcid.org/0000-0003-0786-0671"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Qingfu Zhang","raw_affiliation_strings":["Department of Computing and Electronics Systems, University of Essex, Colchester, UK","Department of Computing and Electronics Systems, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Electronics Systems, University of Essex, Colchester, UK","institution_ids":["https://openalex.org/I110002522"]},{"raw_affiliation_string":"Department of Computing and Electronics Systems, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, U.K","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103551205"],"corresponding_institution_ids":["https://openalex.org/I4210112569","https://openalex.org/I91935597"],"apc_list":null,"apc_paid":null,"fwci":1.5121,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8591177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1141","issue":null,"first_page":"471","last_page":"478"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9984999895095825,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9966999888420105,"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/crossover","display_name":"Crossover","score":0.7785366773605347},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7751290798187256},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6670601963996887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6384488344192505},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.6127227544784546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6048742532730103},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5772060751914978},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5671014189720154},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4998354911804199},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4241161346435547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3613632321357727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2714221477508545},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25576460361480713},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.21999385952949524}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7785366773605347},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7751290798187256},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6670601963996887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6384488344192505},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.6127227544784546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6048742532730103},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5772060751914978},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5671014189720154},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4998354911804199},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4241161346435547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3613632321357727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2714221477508545},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25576460361480713},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.21999385952949524},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2009.4982983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4982983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.essex.ac.uk:1984","is_oa":false,"landing_page_url":"http://repository.essex.ac.uk/1984/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401236","display_name":"Open Access at Essex (University of Essex)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I110002522","host_organization_name":"University of Essex","host_organization_lineage":["https://openalex.org/I110002522"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:tkuir.lib.tku.edu.tw:987654321/121538","is_oa":false,"landing_page_url":"https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W22194143","https://openalex.org/W1513155634","https://openalex.org/W1540706608","https://openalex.org/W1692958259","https://openalex.org/W1759473060","https://openalex.org/W1970320473","https://openalex.org/W1975172421","https://openalex.org/W1979356488","https://openalex.org/W1985748851","https://openalex.org/W2042312329","https://openalex.org/W2053215673","https://openalex.org/W2077580942","https://openalex.org/W2109694902","https://openalex.org/W2135006842","https://openalex.org/W2142661676","https://openalex.org/W2144952620","https://openalex.org/W2148379945","https://openalex.org/W2414365832","https://openalex.org/W3154803405","https://openalex.org/W6637888075","https://openalex.org/W6680128953"],"related_works":["https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W2387767111","https://openalex.org/W4251765387","https://openalex.org/W4255557803","https://openalex.org/W4231702299","https://openalex.org/W2376408785"],"abstract_inverted_index":{"This":[0,135],"paper":[1],"proposed":[2],"self-guided":[3,70,155,163,174],"genetic":[4,58],"algorithm,":[5],"which":[6,108],"is":[7,62,86,124,176],"one":[8],"of":[9,15,33,68,112,131],"the":[10,13,31,40,44,53,78,83,94,100,110,113,121,128,138,143,149,154,180],"algorithms":[11,159],"in":[12,64,117,178],"category":[14],"evolutionary":[16,129],"algorithm":[17],"based":[18],"on":[19],"probabilistic":[20,41,54,79,101,122],"models":[21],"(EAPM),":[22],"to":[23,74,126],"solve":[24,90],"strong":[25],"NP-hard":[26],"flowshop":[27,139,181],"scheduling":[28,140,182],"problems":[29,141],"with":[30],"minimization":[32],"makespan.":[34],"Most":[35],"EAPM":[36,61],"research":[37,136],"explicitly":[38],"used":[39,125],"model":[42,55,80,102,123],"from":[43,52],"parental":[45],"distribution,":[46],"then":[47],"generated":[48],"solutions":[49],"by":[50,77],"sampling":[51],"without":[56],"using":[57],"operators.":[59],"Although":[60],"promising":[63,177],"solving":[65,179],"different":[66],"kinds":[67],"problems,":[69,92],"GA":[71,156,164,175],"doesn't":[72],"intend":[73],"generate":[75],"solution":[76,115],"directly":[81],"because":[82],"time":[84],"complexity":[85],"high":[87],"when":[88],"we":[89],"combinatorial":[91],"particularly":[93],"sequencing":[95],"ones.":[96],"As":[97,171],"a":[98,105,172],"result,":[99,173],"serves":[103],"as":[104],"fitness":[106,111],"surrogate":[107],"estimates":[109],"new":[114],"beforehand":[116],"this":[118],"research.":[119],"So":[120],"guide":[127],"process":[130],"crossover":[132],"and":[133,142],"mutation.":[134],"studied":[137],"corresponding":[144],"experiment":[145],"were":[146],"conducted.":[147],"From":[148],"results,":[150],"it":[151],"shows":[152],"that":[153],"outperformed":[157],"other":[158],"significantly.":[160],"In":[161],"addition,":[162],"works":[165],"more":[166],"efficiently":[167],"than":[168],"previous":[169],"EAPM.":[170],"problems.":[183]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}