{"id":"https://openalex.org/W4231667383","doi":"https://doi.org/10.1080/18756891.2011.9727804","title":"A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times","display_name":"A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W4231667383","doi":"https://doi.org/10.1080/18756891.2011.9727804"},"language":"en","primary_location":{"id":"doi:10.1080/18756891.2011.9727804","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2011.9727804","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1080/18756891.2011.9727804","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073080302","display_name":"Fardin Ahmadizar","orcid":"https://orcid.org/0000-0002-8615-9893"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Fardin Ahmadizar","raw_affiliation_strings":["Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran","institution_ids":["https://openalex.org/I3124704065"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019420980","display_name":"Leila Hosseini","orcid":null},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Leila Hosseini","raw_affiliation_strings":["Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran E-mail: leila.hosseini@ uok.ac.ir"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran E-mail: leila.hosseini@ uok.ac.ir","institution_ids":["https://openalex.org/I3124704065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073080302"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":{"value":1390,"currency":"GBP","value_usd":1704},"apc_paid":{"value":1390,"currency":"GBP","value_usd":1704},"fwci":2.2666,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90115069,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":"4","first_page":"456","last_page":"466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9926999807357788,"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/tardiness","display_name":"Tardiness","score":0.9172052145004272},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7598366141319275},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7277655601501465},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.638847827911377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6045254468917847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5851645469665527},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5708428621292114},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.56749027967453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5406754016876221},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4981253147125244},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4933423101902008},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.4797878861427307},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.47393256425857544},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42210865020751953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32398054003715515},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2514055371284485},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.2398497760295868},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1362423598766327}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9172052145004272},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7598366141319275},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7277655601501465},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.638847827911377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6045254468917847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5851645469665527},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5708428621292114},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.56749027967453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5406754016876221},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4981253147125244},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4933423101902008},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.4797878861427307},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.47393256425857544},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42210865020751953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32398054003715515},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2514055371284485},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2398497760295868},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1362423598766327},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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.1080/18756891.2011.9727804","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2011.9727804","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/18756891.2011.9727804","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2011.9727804","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W1981475023","https://openalex.org/W1982693868","https://openalex.org/W1993362995","https://openalex.org/W1997425713","https://openalex.org/W2009013102","https://openalex.org/W2034116395","https://openalex.org/W2040245988","https://openalex.org/W2088303050","https://openalex.org/W2091005900","https://openalex.org/W2107072968","https://openalex.org/W2122967269","https://openalex.org/W2154929945","https://openalex.org/W2168623380","https://openalex.org/W2582025857","https://openalex.org/W4232195336","https://openalex.org/W4237418189"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,11,150],"the":[4,31,34,47,57,94,105,111,117,146],"NP-hard":[5],"single-machine":[6],"total":[7],"weighted":[8],"tardiness":[9],"problem":[10],"sequence":[12],"dependent":[13],"setup":[14],"times.":[15],"Incorporating":[16],"fuzzy":[17,67],"sets":[18,68],"and":[19,69,85,127,131,148],"genetic":[20,80],"operators,":[21],"a":[22,140],"novel":[23],"ant":[24],"colony":[25],"optimization":[26],"algorithm":[27,136],"is":[28,100,137],"developed":[29],"for":[30],"problem.":[32],"In":[33],"proposed":[35,135],"algorithm,":[36],"artificial":[37,74],"ants":[38,75],"construct":[39],"solutions":[40,112],"as":[41,50,52,66,83,122,124],"orders":[42],"of":[43,93,108,110,142],"jobs":[44],"based":[45],"on":[46,139],"heuristic":[48,58],"information":[49],"well":[51,123],"pheromone":[53,118],"trails.":[54],"To":[55],"calculate":[56],"information,":[59],"three":[60],"well-known":[61],"priority":[62],"rules":[63],"are":[64,87,120],"adopted":[65],"then":[70,101],"aggregated.":[71],"When":[72],"all":[73],"have":[76],"terminated":[77],"their":[78],"constructions,":[79],"operators":[81],"such":[82],"crossover":[84],"mutation":[86],"applied":[88],"to":[89,103],"generate":[90],"new":[91],"regions":[92],"solution":[95],"space.":[96],"A":[97],"local":[98],"search":[99],"performed":[102],"improve":[104],"performance":[106],"quality":[107],"some":[109],"found.":[113],"Moreover,":[114],"at":[115],"run-time":[116],"trails":[119],"locally":[121],"globally":[125],"updated,":[126],"limited":[128],"between":[129],"lower":[130],"upper":[132],"bounds.":[133],"The":[134],"experimented":[138],"set":[141],"benchmark":[143],"problems":[144],"from":[145],"literature":[147],"compared":[149],"other":[151],"metaheuristics.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"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"}