{"id":"https://openalex.org/W2167265142","doi":"https://doi.org/10.1080/095119298130912","title":"Genetic algorithms applied to workshop problems","display_name":"Genetic algorithms applied to workshop problems","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2167265142","doi":"https://doi.org/10.1080/095119298130912","mag":"2167265142"},"language":"en","primary_location":{"id":"doi:10.1080/095119298130912","is_oa":false,"landing_page_url":"https://doi.org/10.1080/095119298130912","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-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/A5022030807","display_name":"G\u00e9rard Fleury","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerard Fleury","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076175192","display_name":"Michel Gourgand","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Gourgand","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5004,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92507163,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"2","first_page":"183","last_page":"192"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9922000169754028,"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.9876000285148621,"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/tardiness","display_name":"Tardiness","score":0.9045403599739075},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7406805753707886},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6565291881561279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6554583311080933},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6092898845672607},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5407898426055908},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5378168821334839},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5319226980209351},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5114520788192749},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4576377868652344},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.19753456115722656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19085434079170227},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07125800848007202}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9045403599739075},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7406805753707886},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6565291881561279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6554583311080933},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6092898845672607},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5407898426055908},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5378168821334839},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5319226980209351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5114520788192749},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4576377868652344},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.19753456115722656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19085434079170227},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07125800848007202},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/095119298130912","is_oa":false,"landing_page_url":"https://doi.org/10.1080/095119298130912","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W81817646","https://openalex.org/W1507363803","https://openalex.org/W1528149415","https://openalex.org/W1661761688","https://openalex.org/W1976586958","https://openalex.org/W1977745207","https://openalex.org/W2168745915","https://openalex.org/W2217162450"],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2960025371","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W1585212810","https://openalex.org/W2353965122","https://openalex.org/W2001283270"],"abstract_inverted_index":{"We":[0,24],"evaluate":[1],"in":[2,19,28],"this":[3],"paper":[4],"the":[5,20,61,96],"qualities":[6],"of":[7,22],"stochastic":[8],"algorithms,":[9,15,78],"mainly":[10],"genetic":[11,67,99],"and":[12,32,52,79,116],"simulated":[13],"annealing-type":[14,77,107],"against":[16],"heuristic":[17,82],"methods,":[18],"scheduling":[21,122],"workshops.":[23,126],"are":[25,50,55,69,114],"particularly":[26],"interested":[27],"flow-shops":[29],"(minimizing":[30,36],"makespan)":[31],"one":[33,90],"machine":[34],"schedules":[35],"total":[37,41],"tardiness,":[38],"or":[39,104],"minimizing":[40],"flow":[42],"time).":[43],"Many":[44],"numerical":[45],"results":[46],"for":[47,120],"various":[48],"samples":[49],"given,":[51],"our":[53],"conclusions":[54],"supported":[56],"by":[57],"statistical":[58],"tests.":[59],"When":[60],"initial":[62,97],"population":[63],"is":[64],"randomly":[65],"generated,":[66],"algorithms":[68,100],"shown":[70],"to":[71,95],"be":[72,118],"statistically":[73],"less":[74],"efficient":[75],"than":[76,81,106],"better":[80,105],"methods.":[83],"But,":[84],"as":[85,87,102],"soon":[86],"at":[88],"least":[89],"good":[91],"item":[92],"(e.g.,heuristicallyfound)":[93],"belongs":[94],"population,":[98],"become":[101],"good,":[103],"algorithms.":[108],"The":[109],"resolution":[110],"methods":[111],"we":[112],"propose":[113],"evaluated":[115],"can":[117],"used":[119],"when":[121],"more":[123],"complicated":[124],"real":[125]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}