{"id":"https://openalex.org/W2118741969","doi":"https://doi.org/10.1109/icsmc.2010.5642208","title":"Variety of meta-heuristics based on genetic algorithms to solve a generalized job-shop problem","display_name":"Variety of meta-heuristics based on genetic algorithms to solve a generalized job-shop problem","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2118741969","doi":"https://doi.org/10.1109/icsmc.2010.5642208","mag":"2118741969"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2010.5642208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5642208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","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/A5108224392","display_name":"Fatima Ghe","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100943","display_name":"Centre de Recherche en Sciences et Technologies de l'Information et de la Communication","ror":"https://ror.org/016wdna72","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I4210100943","https://openalex.org/I4210141980","https://openalex.org/I96226040"]},{"id":"https://openalex.org/I96226040","display_name":"Universit\u00e9 de Reims Champagne-Ardenne","ror":"https://ror.org/03hypw319","country_code":"FR","type":"education","lineage":["https://openalex.org/I96226040"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fatima Ghe","raw_affiliation_strings":["CReSTIC-URCA, Reims, France","CReSTIC (URCA), Moulin de la Housse BP 1039, 51687 Reims cedex2-France"],"affiliations":[{"raw_affiliation_string":"CReSTIC-URCA, Reims, France","institution_ids":["https://openalex.org/I4210100943","https://openalex.org/I96226040"]},{"raw_affiliation_string":"CReSTIC (URCA), Moulin de la Housse BP 1039, 51687 Reims cedex2-France","institution_ids":["https://openalex.org/I96226040","https://openalex.org/I4210100943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108224392"],"corresponding_institution_ids":["https://openalex.org/I4210100943","https://openalex.org/I96226040"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21657289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"4023","last_page":"4028"},"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.996399998664856,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7860504388809204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6755576729774475},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6466464996337891},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5751537084579468},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5437459349632263},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4550304710865021},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.45418986678123474},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.43917858600616455},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4319302439689636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3999837636947632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1949959397315979},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17663896083831787},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17230850458145142},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10680744051933289}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7860504388809204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755576729774475},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6466464996337891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5751537084579468},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5437459349632263},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4550304710865021},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.45418986678123474},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.43917858600616455},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4319302439689636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3999837636947632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1949959397315979},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17663896083831787},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17230850458145142},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10680744051933289},{"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/icsmc.2010.5642208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5642208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03713835v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03713835","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":"IEEE International Conference on Systems, Man and Cybernetics (IEEE SMC 2010), Oct 2010, Istanbul, Turkey","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6499999761581421,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W17748033","https://openalex.org/W81817646","https://openalex.org/W321648571","https://openalex.org/W331797721","https://openalex.org/W1488422606","https://openalex.org/W1497256448","https://openalex.org/W1578393489","https://openalex.org/W1964373220","https://openalex.org/W1966423772","https://openalex.org/W1969959378","https://openalex.org/W1970176495","https://openalex.org/W1992734168","https://openalex.org/W1996601485","https://openalex.org/W2005587985","https://openalex.org/W2005845593","https://openalex.org/W2009356031","https://openalex.org/W2011039300","https://openalex.org/W2014034914","https://openalex.org/W2014788163","https://openalex.org/W2039844430","https://openalex.org/W2054004240","https://openalex.org/W2059934612","https://openalex.org/W2105854030","https://openalex.org/W2123364433","https://openalex.org/W2142950047","https://openalex.org/W2145079270","https://openalex.org/W2171776966","https://openalex.org/W4205794590","https://openalex.org/W6600690991","https://openalex.org/W6603352242","https://openalex.org/W6629610141"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2069961172","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"In":[0],"this":[1,78],"paper":[2],"we":[3,69],"address":[4],"a":[5,71,103],"generalized":[6],"job-shop":[7],"scheduling":[8,41,46],"problem":[9],"with":[10],"unrelated":[11],"parallel":[12,44],"machines":[13,45],"and":[14,93,101],"precedence":[15],"constraints":[16],"between":[17,122],"the":[18,35,52,64,82,97,123],"jobs":[19],"operations":[20],"(corresponding":[21],"to":[22,33,57,80,91],"either":[23],"linear":[24,27],"or":[25],"non":[26],"process":[28],"routings).":[29],"The":[30,106],"objective":[31],"is":[32,47,60,111,127],"minimize":[34],"completion":[36],"time.":[37],"Resolution":[38],"of":[39,54,66,73,108],"several":[40],"problems,":[42],"including":[43],"referred":[48],"as":[49],"NP-hard.":[50],"So,":[51],"application":[53],"approximate":[55],"methods":[56],"solve":[58,81],"them":[59],"well":[61],"appropriate.":[62],"Considering":[63],"success":[65],"genetic":[67],"algorithms,":[68],"develop":[70],"variety":[72],"original":[74],"techniques":[75,86],"based":[76],"on":[77],"meta-heuristic":[79],"considered":[83,124],"problem.":[84],"These":[85],"integrate":[87],"different":[88],"strategies":[89],"linked":[90],"mutations":[92],"crossovers":[94],"for":[95,99],"selecting":[96],"individuals":[98],"reproduction":[100],"generating":[102],"new":[104],"population.":[105],"performance":[107],"these":[109],"algorithms":[110],"tested":[112],"by":[113],"numerical":[114],"experiments":[115],"using":[116],"randomly":[117],"generated":[118],"benchmarks.":[119],"A":[120],"comparison":[121],"meta-heuristics":[125],"results":[126],"presented.":[128]},"counts_by_year":[],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}