{"id":"https://openalex.org/W2068464886","doi":"https://doi.org/10.1109/icinfa.2013.6720265","title":"A novel heuristic algorithm based on divide-and-merge strategy for single machine scheduling","display_name":"A novel heuristic algorithm based on divide-and-merge strategy for single machine scheduling","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2068464886","doi":"https://doi.org/10.1109/icinfa.2013.6720265","mag":"2068464886"},"language":"en","primary_location":{"id":"doi:10.1109/icinfa.2013.6720265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2013.6720265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Information and Automation (ICIA)","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/A5101485889","display_name":"Hong Li Yin","orcid":null},"institutions":[{"id":"https://openalex.org/I120825670","display_name":"Yunnan Normal University","ror":"https://ror.org/00sc9n023","country_code":"CN","type":"education","lineage":["https://openalex.org/I120825670"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hong Li Yin","raw_affiliation_strings":["School of Computer Science & Information Technology, Yunnan Normal University, Kunming, China","School of Computer Science and Information Technology, Yunnan Normal University, Kunming, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science & Information Technology, Yunnan Normal University, Kunming, China","institution_ids":["https://openalex.org/I120825670"]},{"raw_affiliation_string":"School of Computer Science and Information Technology, Yunnan Normal University, Kunming, China#TAB#","institution_ids":["https://openalex.org/I120825670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027161536","display_name":"Zhi Xia Yue","orcid":null},"institutions":[{"id":"https://openalex.org/I120825670","display_name":"Yunnan Normal University","ror":"https://ror.org/00sc9n023","country_code":"CN","type":"education","lineage":["https://openalex.org/I120825670"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi Xia Yue","raw_affiliation_strings":["School of Computer Science & Information Technology, Yunnan Normal University, Kunming, China","School of Computer Science and Information Technology, Yunnan Normal University, Kunming, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science & Information Technology, Yunnan Normal University, Kunming, China","institution_ids":["https://openalex.org/I120825670"]},{"raw_affiliation_string":"School of Computer Science and Information Technology, Yunnan Normal University, Kunming, China#TAB#","institution_ids":["https://openalex.org/I120825670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101485889"],"corresponding_institution_ids":["https://openalex.org/I120825670"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19046357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":null,"first_page":"31","last_page":"36"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9975000023841858,"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.9857000112533569,"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/tardiness","display_name":"Tardiness","score":0.8951694965362549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7261378169059753},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6733378767967224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6036738157272339},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5345078706741333},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5120590329170227},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4485378563404083},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4202043414115906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4034298360347748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17356017231941223},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07016155123710632}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8951694965362549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7261378169059753},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6733378767967224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6036738157272339},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5345078706741333},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5120590329170227},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4485378563404083},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4202043414115906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4034298360347748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17356017231941223},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07016155123710632},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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/icinfa.2013.6720265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2013.6720265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Information and Automation (ICIA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6000000238418579}],"awards":[],"funders":[{"id":"https://openalex.org/F4320323193","display_name":"Natural Science Foundation of Yunnan Province","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1546279261","https://openalex.org/W1820809630","https://openalex.org/W1967716528","https://openalex.org/W1988328380","https://openalex.org/W2007518229","https://openalex.org/W2043154904","https://openalex.org/W2056466128","https://openalex.org/W2074191424","https://openalex.org/W2082893146","https://openalex.org/W2113856408","https://openalex.org/W2128250282","https://openalex.org/W2160657530","https://openalex.org/W2164483807","https://openalex.org/W2164771637","https://openalex.org/W2315944971","https://openalex.org/W2322502908","https://openalex.org/W2331004235","https://openalex.org/W4231667383"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2162966494","https://openalex.org/W2051062041","https://openalex.org/W2017557756","https://openalex.org/W2153799489","https://openalex.org/W1593271705","https://openalex.org/W1973745066","https://openalex.org/W2951717752"],"abstract_inverted_index":{"Many":[0],"optimization":[1,23],"problems":[2],"in":[3,9,15],"the":[4,35,38,75,92,105,147],"industrial":[5],"engineering":[6],"world,":[7],"particularly":[8],"manufacturing":[10],"systems,":[11],"are":[12,96],"very":[13],"complex":[14],"nature":[16],"and":[17,62,91],"difficult":[18],"to":[19,34,99,104,114,153,159],"solve":[20],"by":[21],"conventional":[22],"techniques.":[24],"The":[25,108,143],"use":[26],"of":[27,37,68,94,110,123],"formal":[28],"approaches":[29],"is":[30,48,89,113,139],"frequently":[31],"limited":[32],"owing":[33],"complexity":[36],"models":[39],"or":[40],"algorithms.":[41],"In":[42],"this":[43],"paper,":[44],"a":[45,69,80,84,101,120],"novel":[46],"approach":[47,149],"proposed":[49,111,148],"for":[50],"large":[51],"scale":[52],"single":[53,132,160],"machine":[54,133,161],"weighted":[55,135,162],"tardiness":[56,136,163],"problems,":[57,157],"which":[58,138],"combine":[59],"heuristic":[60],"algorithm":[61,129],"divide-and-merge":[63],"strategy.":[64],"Given":[65],"an":[66,140],"instance":[67],"scheduling":[70],"problem,":[71,137],"our":[72,128],"method":[73,112],"divides":[74],"problem":[76,164],"into":[77],"subproblems":[78,95],"using":[79],"feasible":[81],"solution":[82,103,118],"as":[83],"basis;":[85],"then":[86,97],"ach":[87],"subproblem":[88],"optimized":[90],"solutions":[93],"merged":[98],"form":[100],"complete":[102],"original":[106],"problem.":[107,142],"aim":[109],"find":[115],"good":[116],"quality":[117],"within":[119],"reasonable":[121],"amount":[122],"computational":[124],"time.":[125],"We":[126],"test":[127],"on":[130],"big":[131,166],"total":[134],"NP-hard":[141],"results":[144],"show":[145],"that":[146],"have":[150],"promising":[151],"application":[152],"some":[154],"traditional":[155],"hard":[156],"especially":[158],"with":[165],"scale.":[167]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}