{"id":"https://openalex.org/W2171836724","doi":"https://doi.org/10.1109/cec.2009.4983048","title":"Genetic algorithm and local search for just-in-time job-shop scheduling","display_name":"Genetic algorithm and local search for just-in-time job-shop scheduling","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2171836724","doi":"https://doi.org/10.1109/cec.2009.4983048","mag":"2171836724"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983048","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/A5084183968","display_name":"Rodolfo Pereira Ara\u00fajo","orcid":"https://orcid.org/0000-0001-5846-6346"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Rodolfo Pereira Araujo","raw_affiliation_strings":["Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086393146","display_name":"Andr\u00e9 Gustavo dos Santos","orcid":"https://orcid.org/0000-0002-5743-3523"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre Gustavo dos Santos","raw_affiliation_strings":["Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jose Elias Claudio Arroyo","raw_affiliation_strings":["Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Vi\u00e7osa Federal University, Vicosa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084183968"],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":1.5007,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86949257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"39","issue":null,"first_page":"955","last_page":"961"},"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.9830999970436096,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9574939012527466},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.691301167011261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.671727180480957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6278351545333862},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.601621687412262},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5648168325424194},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.5511130094528198},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5379742980003357},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5188935399055481},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.48743942379951477},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44570600986480713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35432156920433044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2391655445098877},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07719320058822632}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9574939012527466},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.691301167011261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.671727180480957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6278351545333862},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.601621687412262},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5648168325424194},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5511130094528198},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5379742980003357},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5188935399055481},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.48743942379951477},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44570600986480713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35432156920433044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2391655445098877},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07719320058822632},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983048","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1529681250","https://openalex.org/W1535845781","https://openalex.org/W1598721301","https://openalex.org/W2011039300","https://openalex.org/W2019595142","https://openalex.org/W2030250600","https://openalex.org/W2064542310","https://openalex.org/W2064661781","https://openalex.org/W2076785727","https://openalex.org/W2093563804","https://openalex.org/W2153446897","https://openalex.org/W2170428215","https://openalex.org/W2476096155","https://openalex.org/W4285719527","https://openalex.org/W6682763932"],"related_works":["https://openalex.org/W3216729967","https://openalex.org/W2054689640","https://openalex.org/W2968175378","https://openalex.org/W2738406632","https://openalex.org/W2155502865","https://openalex.org/W1980423862","https://openalex.org/W1988852867","https://openalex.org/W1989507232","https://openalex.org/W1966275911","https://openalex.org/W2090815864"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,32,48,51,103,123],"successful":[4],"combination":[5],"of":[6,35,115,125,147],"genetic":[7,89],"algorithm":[8,90,140],"and":[9,24,44,54,56,120,135],"local":[10,104],"search":[11,105],"procedure":[12,106],"to":[13,78,80,122,132],"find":[14],"good":[15,92],"solutions":[16,93,117],"for":[17,83,94,145],"just-in-time":[18],"job-shop":[19],"scheduling":[20],"problem":[21,74,96],"with":[22,130],"earliness":[23,55],"tardiness":[25,57],"penalties.":[26],"For":[27],"each":[28,45],"job":[29],"is":[30,65,75,107,118],"given":[31],"specific":[33],"order":[34],"machines":[36],"in":[37],"which":[38,59],"its":[39,70,100],"operations":[40],"must":[41],"be":[42],"processed,":[43],"operation":[46,64],"has":[47],"due":[49,71],"date,":[50],"processing":[52],"time,":[53],"penalties,":[58],"are":[60],"paid":[61],"if":[62],"the":[63,87,116,128,142,148],"completed":[66],"before":[67],"or":[68],"after":[69],"date.":[72],"The":[73,113,138],"very":[76],"hard":[77],"solve":[79],"optimality":[81],"even":[82,98],"small":[84],"instances,":[85,97],"but":[86],"proposed":[88,139],"found":[91],"some":[95],"improving":[99],"performance":[101],"when":[102],"invoked":[108],"as":[109],"an":[110],"additional":[111],"phase.":[112],"quality":[114],"evaluated":[119],"compared":[121],"set":[124],"instances":[126],"from":[127],"literature,":[129],"up":[131],"20":[133],"jobs":[134],"10":[136],"machines.":[137],"improved":[141],"solution":[143],"value":[144],"most":[146],"instances.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}