{"id":"https://openalex.org/W2166519991","doi":"https://doi.org/10.1109/cscwd.2009.4968122","title":"Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization","display_name":"Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2166519991","doi":"https://doi.org/10.1109/cscwd.2009.4968122","mag":"2166519991"},"language":"en","primary_location":{"id":"doi:10.1109/cscwd.2009.4968122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2009.4968122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 13th International Conference on Computer Supported Cooperative Work in Design","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/A5100388198","display_name":"Yi Zhang","orcid":"https://orcid.org/0000-0002-6375-1712"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yi Zhang","raw_affiliation_strings":["Southeast University, Nanjing, Jiangsu, CN"],"affiliations":[{"raw_affiliation_string":"Southeast University, Nanjing, Jiangsu, CN","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041611973","display_name":"Xiaoping Li","orcid":"https://orcid.org/0000-0003-3201-0038"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoping Li","raw_affiliation_strings":["Southeast University, Nanjing, Jiangsu, CN"],"affiliations":[{"raw_affiliation_string":"Southeast University, Nanjing, Jiangsu, CN","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100621420","display_name":"Qian Wang","orcid":"https://orcid.org/0000-0002-2931-7875"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qian Wang","raw_affiliation_strings":["Southeast University, Nanjing, Jiangsu, CN"],"affiliations":[{"raw_affiliation_string":"Southeast University, Nanjing, Jiangsu, CN","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000539711","display_name":"Jie Zhu","orcid":"https://orcid.org/0000-0002-8568-037X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jie Zhu","raw_affiliation_strings":["Southeast University, Nanjing, Jiangsu, CN"],"affiliations":[{"raw_affiliation_string":"Southeast University, Nanjing, Jiangsu, CN","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100388198"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0014,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.92287398,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4771","issue":null,"first_page":"582","last_page":"589"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9889000058174133,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7808699607849121},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.666424036026001},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5695379972457886},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5664986968040466},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5635161399841309},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5550614595413208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5131416916847229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5099214315414429},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.49916696548461914},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4912094473838806},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43130743503570557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34749430418014526},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26545199751853943},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08644217252731323}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7808699607849121},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.666424036026001},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5695379972457886},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5664986968040466},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5635161399841309},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5550614595413208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5131416916847229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5099214315414429},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.49916696548461914},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4912094473838806},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43130743503570557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34749430418014526},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26545199751853943},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08644217252731323},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cscwd.2009.4968122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2009.4968122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 13th International Conference on Computer Supported Cooperative Work in Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W250249669","https://openalex.org/W331797721","https://openalex.org/W1972789041","https://openalex.org/W1977133017","https://openalex.org/W2006751452","https://openalex.org/W2008665401","https://openalex.org/W2021332592","https://openalex.org/W2041091377","https://openalex.org/W2049258233","https://openalex.org/W2050942141","https://openalex.org/W2079003114","https://openalex.org/W2081684339","https://openalex.org/W2138441200","https://openalex.org/W2156391157","https://openalex.org/W2168397479","https://openalex.org/W4300445707","https://openalex.org/W6670381087","https://openalex.org/W6671394848"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W1974309933","https://openalex.org/W4206466499","https://openalex.org/W2388326823","https://openalex.org/W4213379045","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2381829748","https://openalex.org/W3190401582","https://openalex.org/W2244460820"],"abstract_inverted_index":{"In":[0],"the":[1,12,28,43,51,62,69,102,122,126,134],"paper,":[2],"a":[3],"similarity":[4,119],"based":[5],"ant-colony":[6,94,116],"algorithm":[7],"(SACO)":[8],"is":[9,22,33,39,59,65,80,83],"proposed":[10],"for":[11,61,72,129],"permutation":[13],"flowshop":[14],"scheduling":[15],"problems":[16],"with":[17],"total":[18],"flowtime":[19],"minimization,":[20],"which":[21,32,82,132],"known":[23],"as":[24],"NP-hard.":[25],"By":[26],"applying":[27],"space":[29],"mapping":[30],"method":[31,79],"testified":[34],"to":[35,67,85,124],"be":[36,86,136],"reasonable,":[37],"it":[38],"proved":[40],"theoretically":[41],"that":[42,89,99],"deposit":[44],"factor":[45],"\u03c1":[46,56],"has":[47],"hardly":[48],"impact":[49],"on":[50],"ACO":[52],"evolutionary":[53],"availability,":[54],"and":[55,113],"=":[57],"0.5":[58],"reasonable":[60],"ACO.":[63],"Similarity":[64],"defined":[66],"discover":[68],"promising":[70,127],"sequence":[71,128],"solution":[73,77,130],"improvement.":[74],"A":[75],"new":[76],"construction":[78],"proposed,":[81],"stated":[84],"better":[87],"than":[88],"of":[90],"another":[91],"very":[92],"effective":[93,111],"algorithm.":[95],"Experimental":[96],"results":[97],"show":[98],"SACO":[100,123,135],"outperforms":[101],"other":[103],"compared":[104],"seven":[105],"algorithms,":[106],"including":[107],"three":[108],"rather":[109],"recent":[110],"algorithms":[112],"four":[114],"famous":[115],"algorithms.":[117],"The":[118],"indeed":[120],"helps":[121],"find":[125],"improvement,":[131],"makes":[133],"effective.":[137]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}