{"id":"https://openalex.org/W2910230353","doi":"https://doi.org/10.1145/3297280.3297302","title":"An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem","display_name":"An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem","publication_year":2019,"publication_date":"2019-04-08","ids":{"openalex":"https://openalex.org/W2910230353","doi":"https://doi.org/10.1145/3297280.3297302","mag":"2910230353"},"language":"en","primary_location":{"id":"doi:10.1145/3297280.3297302","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297280.3297302","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/handle/10993/38175","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054363087","display_name":"Willian T. Lunardi","orcid":"https://orcid.org/0000-0003-0718-0019"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Willian Tessaro Lunardi","raw_affiliation_strings":["University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049772606","display_name":"Holger Voos","orcid":"https://orcid.org/0000-0002-9600-8386"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Holger Voos","raw_affiliation_strings":["University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074315326","display_name":"Luiz Henrique Cherri","orcid":"https://orcid.org/0000-0003-3958-2629"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz Henrique Cherri","raw_affiliation_strings":["University of S\u00e3o Paulo, S\u00e3o Paulo, Brazil"],"affiliations":[{"raw_affiliation_string":"University of S\u00e3o Paulo, S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054363087"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.4351,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68690909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"204","last_page":"211"},"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.9983000159263611,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9943000078201294,"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/tabu-search","display_name":"Tabu search","score":0.8703552484512329},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8474385738372803},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.6702070236206055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6344395875930786},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.6249647736549377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6037579774856567},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5943742394447327},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4875759482383728},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4505501389503479},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4426983892917633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3103811740875244},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2652272582054138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22822871804237366},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0940522849559784}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8703552484512329},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8474385738372803},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.6702070236206055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6344395875930786},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.6249647736549377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037579774856567},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5943742394447327},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4875759482383728},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4505501389503479},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4426983892917633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3103811740875244},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2652272582054138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22822871804237366},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0940522849559784},{"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/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3297280.3297302","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297280.3297302","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/38175","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/38175","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"34th ACM/SIGAPP Symposium On Applied Computing, Limassol, Cyprus April 8-12, 2019, 8 (2019-04-08); 34th ACM/SIGAPP Symposium On Applied Computing, 08-04-2019 to 12-04-2019","raw_type":"peer reviewed"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/38175","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/38175","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"34th ACM/SIGAPP Symposium On Applied Computing, Limassol, Cyprus April 8-12, 2019, 8 (2019-04-08); 34th ACM/SIGAPP Symposium On Applied Computing, 08-04-2019 to 12-04-2019","raw_type":"peer reviewed"},"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1964674593","https://openalex.org/W1966146596","https://openalex.org/W1969109994","https://openalex.org/W1992935927","https://openalex.org/W2000099188","https://openalex.org/W2021996073","https://openalex.org/W2027461575","https://openalex.org/W2033011996","https://openalex.org/W2040789431","https://openalex.org/W2053131909","https://openalex.org/W2057285547","https://openalex.org/W2061438946","https://openalex.org/W2068142293","https://openalex.org/W2098650167","https://openalex.org/W2099235707","https://openalex.org/W2104517380","https://openalex.org/W2105898271","https://openalex.org/W2156109274","https://openalex.org/W2157846217","https://openalex.org/W2198739890","https://openalex.org/W2260286117","https://openalex.org/W2339500526","https://openalex.org/W2771113074","https://openalex.org/W2991337620","https://openalex.org/W3145128584","https://openalex.org/W4298851888"],"related_works":["https://openalex.org/W1987877777","https://openalex.org/W2370323645","https://openalex.org/W4247343174","https://openalex.org/W2168643831","https://openalex.org/W4243772339","https://openalex.org/W1559717033","https://openalex.org/W2139271550","https://openalex.org/W2075514833","https://openalex.org/W192716354","https://openalex.org/W2311821525"],"abstract_inverted_index":{"An":[0],"extended":[1],"version":[2],"of":[3,17,40,47,72,103],"the":[4,18,25,28,49,52,60,66,70,73,96,101,104],"flexible":[5,20],"job":[6,21],"shop":[7,22],"problem":[8,23,45],"is":[9,69,92],"tackled":[10],"in":[11,57,65,81],"this":[12],"work.":[13],"The":[14,44,63],"investigated":[15],"extension":[16],"classical":[19],"allows":[24],"precedences":[26],"between":[27],"operations":[29,50],"to":[30,51,77,94],"be":[31],"given":[32],"by":[33],"an":[34],"arbitrary":[35],"directed":[36],"acyclic":[37],"graph":[38],"instead":[39],"a":[41,84],"linear":[42],"order.":[43],"consists":[46],"designating":[48],"machines":[53],"and":[54,89,107],"sequencing":[55],"them":[56],"compliance":[58],"with":[59,110],"supplied":[61],"precedences.":[62],"goal":[64],"present":[67],"work":[68],"minimization":[71],"makespan.":[74],"In":[75],"order":[76],"produce":[78],"reasonable":[79],"outcomes":[80],"acceptable":[82],"time,":[83],"hybrid":[85],"imperialist":[86],"competitive":[87],"algorithm":[88],"tabu":[90],"search":[91],"proposed":[93,105],"solve":[95],"problem.":[97],"Numerical":[98],"experiments":[99],"assess":[100],"efficiency":[102],"method":[106],"compare":[108],"it":[109],"well-known":[111],"scheduling":[112],"algorithms.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}