{"id":"https://openalex.org/W2030085316","doi":"https://doi.org/10.1109/icnc.2010.5582566","title":"Application of improved genetic algorithm for solving machine scheduling","display_name":"Application of improved genetic algorithm for solving machine scheduling","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2030085316","doi":"https://doi.org/10.1109/icnc.2010.5582566","mag":"2030085316"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5582566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582566","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101412228","display_name":"Xiaoling Huang","orcid":"https://orcid.org/0000-0002-1500-6822"},"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":"Xiaoling Huang","raw_affiliation_strings":["College of Transportation Management, Dalian Maritime University, Dalian, China","College of Transportation Management, Dalian Maritime University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081014262","display_name":"Xiuquan Chen","orcid":null},"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":"Xiuquan Chen","raw_affiliation_strings":["College of Transportation Management, Dalian Maritime University, Dalian, China","College of Transportation Management, Dalian Maritime University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025842723","display_name":"Hongxing Zheng","orcid":"https://orcid.org/0000-0001-7738-5496"},"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":"Hongxing Zheng","raw_affiliation_strings":["College of Transportation Management, Dalian Maritime University, Dalian, China","College of Transportation Management, Dalian Maritime University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"College of Transportation Management, Dalian Maritime University, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008531035","display_name":"Jinxue Xu","orcid":null},"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":"Jinxue Xu","raw_affiliation_strings":["College of Information, Dalian Maritime University, Dalian, China","College of Information, Dalian Maritime University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"College of Information, Dalian Maritime University, China","institution_ids":["https://openalex.org/I43313876"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I43313876"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":null,"first_page":"3825","last_page":"3829"},"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.9983999729156494,"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.996999979019165,"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/crossover","display_name":"Crossover","score":0.8181204795837402},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8093423843383789},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.664413571357727},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6363692283630371},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6071885824203491},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.578291654586792},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5638853311538696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5019216537475586},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45503661036491394},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4376711845397949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2768501341342926},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12337490916252136},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.06790605187416077},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06739625334739685}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8181204795837402},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8093423843383789},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.664413571357727},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6363692283630371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6071885824203491},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.578291654586792},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5638853311538696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5019216537475586},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45503661036491394},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4376711845397949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2768501341342926},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12337490916252136},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.06790605187416077},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06739625334739685},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5582566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582566","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W250249669","https://openalex.org/W331797721","https://openalex.org/W1488422606","https://openalex.org/W1497256448","https://openalex.org/W1829765394","https://openalex.org/W1973531016","https://openalex.org/W1980922590","https://openalex.org/W1984809851","https://openalex.org/W2061653007","https://openalex.org/W2126199113","https://openalex.org/W2128887355","https://openalex.org/W2146379124","https://openalex.org/W2382493959","https://openalex.org/W6665997038","https://openalex.org/W7009705606"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2153505252","https://openalex.org/W3104258108","https://openalex.org/W2114549389","https://openalex.org/W2014162767"],"abstract_inverted_index":{"Due":[0],"to":[1,8,35,47,79],"its":[2],"computational":[3],"complexity,":[4],"it":[5],"is":[6],"hard":[7],"obtain":[9,27],"the":[10,48,57,95],"optimal":[11],"solution":[12],"by":[13,30],"classical":[14,43],"methods,":[15],"while":[16,99],"solving":[17],"scheduling":[18,49,92],"problems":[19],"with":[20],"setup":[21],"time,":[22],"so":[23],"we":[24],"can":[25],"only":[26],"suboptimal":[28],"solutions":[29],"simplified":[31],"means,":[32],"which":[33],"leads":[34],"low":[36],"precision.":[37],"Aiming":[38],"at":[39],"this":[40,54,86],"shortcoming,":[41],"using":[42],"traveling":[44],"salesman":[45],"problem":[46,50],"was":[51],"proposed":[52],"in":[53],"paper,":[55],"and":[56,73,93],"improved":[58],"genetic":[59],"algorithm":[60,87],"that":[61,85],"based":[62],"on":[63],"preferentially":[64],"proportional":[65],"selection":[66],"operator,":[67],"real":[68],"number":[69],"two-point":[70],"crossover":[71],"operator":[72,76],"mode":[74],"mutation":[75],"were":[77],"used":[78],"solve.":[80],"The":[81],"simulations":[82],"results":[83],"show":[84],"both":[88],"solves":[89],"larger":[90],"scale":[91],"improves":[94],"precision":[96],"of":[97],"makespan":[98],"meeting":[100],"minimize":[101],"makespan.":[102]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}