{"id":"https://openalex.org/W2160815807","doi":"https://doi.org/10.1109/icsmc.2009.5346060","title":"Neural network and genetic algorithm-based hybrid approach to dynamic job shop scheduling problem","display_name":"Neural network and genetic algorithm-based hybrid approach to dynamic job shop scheduling problem","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2160815807","doi":"https://doi.org/10.1109/icsmc.2009.5346060","mag":"2160815807"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2009.5346060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","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/A5100339258","display_name":"Ye Li","orcid":"https://orcid.org/0000-0002-9636-8170"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ye Li","raw_affiliation_strings":["Transportation Management College, Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Transportation Management College, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100703983","display_name":"Yan Chen","orcid":"https://orcid.org/0009-0005-0674-2675"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Chen","raw_affiliation_strings":["Transportation Management College, Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Transportation Management College, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100339258"],"corresponding_institution_ids":["https://openalex.org/I43313876"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.21603798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":null,"first_page":"4836","last_page":"4841"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9940999746322632,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9934999942779541,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8205374479293823},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7522710561752319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7003777027130127},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6778777241706848},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6461820602416992},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5664874315261841},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5156913995742798},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.512927770614624},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.44230949878692627},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4194563627243042},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1953088641166687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13712745904922485},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05687102675437927}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8205374479293823},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7522710561752319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7003777027130127},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6778777241706848},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6461820602416992},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5664874315261841},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5156913995742798},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.512927770614624},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.44230949878692627},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4194563627243042},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1953088641166687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13712745904922485},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05687102675437927},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2009.5346060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W171221056","https://openalex.org/W1980872196","https://openalex.org/W1987433326","https://openalex.org/W1993683767","https://openalex.org/W2002452108","https://openalex.org/W2006210883","https://openalex.org/W2012754152","https://openalex.org/W2024793042","https://openalex.org/W2042103190","https://openalex.org/W2053859224","https://openalex.org/W2059771702","https://openalex.org/W2062456035","https://openalex.org/W2064542310","https://openalex.org/W2076441555","https://openalex.org/W2078740169","https://openalex.org/W2095956067","https://openalex.org/W2170428215"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W3036719625","https://openalex.org/W2225350526","https://openalex.org/W2978148977","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2384952691"],"abstract_inverted_index":{"In":[0],"this":[1,50],"paper,":[2],"we":[3],"analyze":[4],"the":[5,8,36,59,64,67,71,77,86,97],"characteristics":[6],"of":[7,49,52,62],"dynamic":[9,37,98],"job":[10,19,38,53],"shop":[11,39,54,88,99],"scheduling":[12,40,45,55,89,100],"problem":[13,41,56,101],"when":[14],"machine":[15],"breakdown":[16],"and":[17,29],"new":[18],"arrivals":[20],"occur.":[21],"A":[22],"hybrid":[23,78],"approach":[24],"involving":[25],"neural":[26],"networks":[27],"(NNs)":[28],"genetic":[30],"algorithm(GA)":[31],"is":[32,57],"presented":[33],"to":[34,70,85,95],"solve":[35,96],"as":[42],"a":[43],"static":[44,87],"problem.":[46],"The":[47,73],"objective":[48],"kind":[51],"minimizing":[58],"completion":[60],"time":[61],"all":[63],"jobs,":[65],"called":[66],"makespan,":[68],"subject":[69],"constraints.":[72],"result":[74],"shows":[75],"that":[76],"methodology":[79],"which":[80],"has":[81],"been":[82],"successfully":[83],"applied":[84,94],"problems":[90],"can":[91],"be":[92],"also":[93],"efficiency.":[102]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}