{"id":"https://openalex.org/W2142781572","doi":"https://doi.org/10.1109/cec.2011.5949601","title":"Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm","display_name":"Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2142781572","doi":"https://doi.org/10.1109/cec.2011.5949601","mag":"2142781572"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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/A5100623231","display_name":"Junqing Li","orcid":"https://orcid.org/0000-0002-3617-6708"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junqing Li","raw_affiliation_strings":["School of Computer, Liaocheng University, Liaocheng, China","School of Computer, Liaocheng University, Liaocheng, China, 252059"],"affiliations":[{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China","institution_ids":["https://openalex.org/I196934937"]},{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China, 252059","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082315337","display_name":"Quan-Ke Pan","orcid":"https://orcid.org/0000-0002-5022-7946"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Quanke Pan","raw_affiliation_strings":["School of Computer, Liaocheng University, Liaocheng, China","School of Computer, Liaocheng University, Liaocheng, China, 252059"],"affiliations":[{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China","institution_ids":["https://openalex.org/I196934937"]},{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China, 252059","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111509128","display_name":"Shengxian Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shengxian Xie","raw_affiliation_strings":["School of Computer, Liaocheng University, Liaocheng, China","School of Computer, Liaocheng University, Liaocheng, China, 252059"],"affiliations":[{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China","institution_ids":["https://openalex.org/I196934937"]},{"raw_affiliation_string":"School of Computer, Liaocheng University, Liaocheng, China, 252059","institution_ids":["https://openalex.org/I196934937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100623231"],"corresponding_institution_ids":["https://openalex.org/I196934937"],"apc_list":null,"apc_paid":null,"fwci":3.7776,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93146919,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"78","last_page":"83"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7825761437416077},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6927615404129028},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.648784339427948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6476510763168335},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6316460371017456},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5771488547325134},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5173115730285645},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4943544864654541},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4678787589073181},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.4631388187408447},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4514913558959961},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4184931218624115},{"id":"https://openalex.org/keywords/bees-algorithm","display_name":"Bees algorithm","score":0.41298532485961914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39446699619293213},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.28153330087661743},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.2761673331260681},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2736642360687256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1638767123222351},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.14936822652816772},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14507868885993958},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.07544785737991333}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7825761437416077},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6927615404129028},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.648784339427948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6476510763168335},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6316460371017456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5771488547325134},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5173115730285645},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4943544864654541},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4678787589073181},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.4631388187408447},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4514913558959961},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4184931218624115},{"id":"https://openalex.org/C143574069","wikidata":"https://www.wikidata.org/wiki/Q3497720","display_name":"Bees algorithm","level":3,"score":0.41298532485961914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39446699619293213},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.28153330087661743},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2761673331260681},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2736642360687256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1638767123222351},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.14936822652816772},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14507868885993958},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.07544785737991333},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1635451898","https://openalex.org/W1964674593","https://openalex.org/W1967271207","https://openalex.org/W1969109994","https://openalex.org/W1970176495","https://openalex.org/W1985864288","https://openalex.org/W1994300791","https://openalex.org/W1995620551","https://openalex.org/W1995714897","https://openalex.org/W1998666917","https://openalex.org/W2000099188","https://openalex.org/W2003584395","https://openalex.org/W2006009875","https://openalex.org/W2019617030","https://openalex.org/W2023444009","https://openalex.org/W2027461575","https://openalex.org/W2037678563","https://openalex.org/W2037917527","https://openalex.org/W2039806905","https://openalex.org/W2046437335","https://openalex.org/W2053131909","https://openalex.org/W2064661781","https://openalex.org/W2076716919","https://openalex.org/W2077388056","https://openalex.org/W2079991732","https://openalex.org/W2102620188","https://openalex.org/W2111855709","https://openalex.org/W2116853369","https://openalex.org/W2122932806","https://openalex.org/W2133346117","https://openalex.org/W2142822379","https://openalex.org/W2144317842","https://openalex.org/W2152665062","https://openalex.org/W2166900052","https://openalex.org/W2167046090","https://openalex.org/W2169064301","https://openalex.org/W4240747904","https://openalex.org/W6651105435","https://openalex.org/W6651871735","https://openalex.org/W6657191725","https://openalex.org/W6679500966","https://openalex.org/W6684442998"],"related_works":["https://openalex.org/W2053666994","https://openalex.org/W2944955692","https://openalex.org/W2578377283","https://openalex.org/W2362117675","https://openalex.org/W3210744354","https://openalex.org/W2910498577","https://openalex.org/W1634182863","https://openalex.org/W2930891413","https://openalex.org/W1560921077","https://openalex.org/W2093505798"],"abstract_inverted_index":{"In":[0,27],"this":[1],"paper,":[2],"an":[3,49],"effective":[4],"artificial":[5],"bee":[6],"colony":[7],"(ABC)":[8],"algorithm":[9,85],"is":[10,35,54,80,86],"proposed":[11,29,76,84],"for":[12,41,61],"solving":[13],"the":[14,28,62,72,75,83,89],"flexible":[15],"job":[16],"shop":[17],"scheduling":[18],"problems.":[19],"The":[20],"total":[21],"flow":[22],"time":[23],"criterion":[24],"was":[25],"considered.":[26,64],"algorithm,":[30],"tabu":[31],"search":[32,40,97],"(TS)":[33],"heuristic":[34],"introduced":[36],"to":[37,56,88],"perform":[38],"local":[39],"employed":[42,55],"bee,":[43],"onlookers,":[44],"and":[45,99],"scout":[46],"bees.":[47],"Meanwhile,":[48],"external":[50],"Pareto":[51],"archive":[52],"set":[53],"record":[57],"enough":[58],"non-dominated":[59],"solutions":[60],"problem":[63],"Experimental":[65],"results":[66],"on":[67],"five":[68],"well-known":[69],"benchmarks":[70],"show":[71],"efficiency":[73],"of":[74,95],"hybrid":[77],"algorithm.":[78],"It":[79],"concluded":[81],"that":[82],"superior":[87],"very":[90],"recent":[91],"algorithms":[92],"in":[93],"term":[94],"both":[96],"quality":[98],"computational":[100],"efficiency.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}