{"id":"https://openalex.org/W2005663395","doi":"https://doi.org/10.1080/09511920512331319627","title":"Application of a kin selection based simulated annealing algorithm to solve a complex scheduling problem","display_name":"Application of a kin selection based simulated annealing algorithm to solve a complex scheduling problem","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2005663395","doi":"https://doi.org/10.1080/09511920512331319627","mag":"2005663395"},"language":"en","primary_location":{"id":"doi:10.1080/09511920512331319627","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09511920512331319627","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-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/A5056526187","display_name":"Manoj Kumar Tiwari","orcid":"https://orcid.org/0000-0001-8564-1402"},"institutions":[{"id":"https://openalex.org/I4402554029","display_name":"National Institute of Advanced Manufacturing Technology","ror":"https://ror.org/03csmp942","country_code":null,"type":"education","lineage":["https://openalex.org/I4402554029"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M. K. Tiwari","raw_affiliation_strings":["Department of Forge Technology, National Institute of Foundry and Forge Technology, Ranchi, 834003, India","Department of Forge Technology, National Institute of Foundry and Forge Technology, Ranchi-834003, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Forge Technology, National Institute of Foundry and Forge Technology, Ranchi, 834003, India","institution_ids":["https://openalex.org/I4402554029"]},{"raw_affiliation_string":"Department of Forge Technology, National Institute of Foundry and Forge Technology, Ranchi-834003, India","institution_ids":["https://openalex.org/I4402554029"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047895060","display_name":"Alok Mukherjee","orcid":"https://orcid.org/0000-0003-4404-1042"},"institutions":[{"id":"https://openalex.org/I1301507905","display_name":"Tata Motors (India)","ror":"https://ror.org/00b1tsa05","country_code":"IN","type":"company","lineage":["https://openalex.org/I1301507905","https://openalex.org/I4210086519"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Mukherjee","raw_affiliation_strings":["TATA Motors, Jamshedpur, 831010, India","TATA Motors , Jamshedpur, 831010, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TATA Motors, Jamshedpur, 831010, India","institution_ids":["https://openalex.org/I1301507905"]},{"raw_affiliation_string":"TATA Motors , Jamshedpur, 831010, India","institution_ids":["https://openalex.org/I1301507905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087600280","display_name":"Ravi Shankar","orcid":"https://orcid.org/0000-0001-8724-593X"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. Shankar","raw_affiliation_strings":["Department of Management Studies, Indian Institute of Technology - Delhi, Hauz Khas, New Delhi, 110016","Department of Management Studies , Indian Institute of Technology - Delhi , Hauz Khas, New Delhi, 110016"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Studies, Indian Institute of Technology - Delhi, Hauz Khas, New Delhi, 110016","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Management Studies , Indian Institute of Technology - Delhi , Hauz Khas, New Delhi, 110016","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15326121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"8","first_page":"671","last_page":"685"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9976000189781189,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9937999844551086,"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/computer-science","display_name":"Computer science","score":0.6591591835021973},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6500840187072754},{"id":"https://openalex.org/keywords/acknowledgement","display_name":"Acknowledgement","score":0.6261321902275085},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5360136032104492},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5023238658905029},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.4829680025577545},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4807019829750061},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48060935735702515},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4779260754585266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42672234773635864},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42667198181152344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33090054988861084},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2716674208641052},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.20846110582351685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1900721788406372},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1014007031917572},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.0940929651260376},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08037042617797852}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6591591835021973},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6500840187072754},{"id":"https://openalex.org/C2777880217","wikidata":"https://www.wikidata.org/wiki/Q4674282","display_name":"Acknowledgement","level":2,"score":0.6261321902275085},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5360136032104492},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5023238658905029},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.4829680025577545},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4807019829750061},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48060935735702515},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4779260754585266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42672234773635864},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42667198181152344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33090054988861084},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2716674208641052},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.20846110582351685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1900721788406372},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1014007031917572},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0940929651260376},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08037042617797852},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09511920512331319627","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09511920512331319627","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1511493290","https://openalex.org/W1555410326","https://openalex.org/W1587100796","https://openalex.org/W1965037454","https://openalex.org/W1970204233","https://openalex.org/W1973293353","https://openalex.org/W1981954658","https://openalex.org/W1995714897","https://openalex.org/W2019544509","https://openalex.org/W2024060531","https://openalex.org/W2030250600","https://openalex.org/W2039070022","https://openalex.org/W2055739151","https://openalex.org/W2056760934","https://openalex.org/W2059134037","https://openalex.org/W2063792498","https://openalex.org/W2066883591","https://openalex.org/W2070494355","https://openalex.org/W2070521870","https://openalex.org/W2072829647","https://openalex.org/W2091104385","https://openalex.org/W2104670598","https://openalex.org/W2110366548","https://openalex.org/W2128193809","https://openalex.org/W2146173781","https://openalex.org/W2168314053","https://openalex.org/W2623660146","https://openalex.org/W2904250082","https://openalex.org/W2914275007","https://openalex.org/W4237542790","https://openalex.org/W4246598646","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1504381137","https://openalex.org/W4283656061","https://openalex.org/W2620413320","https://openalex.org/W3102611879","https://openalex.org/W4385757279","https://openalex.org/W2067129656","https://openalex.org/W1974563604","https://openalex.org/W2211012933","https://openalex.org/W1002241103","https://openalex.org/W2356873024"],"abstract_inverted_index":{"In":[0,114],"this":[1],"article,":[2],"a":[3,14,42,62,74,83,115,120,132],"simulated":[4],"annealing":[5],"(SA)":[6],"based":[7],"heuristic":[8,81,125,149],"approach":[9],"is":[10,36,51,59,101,144],"presented":[11],"to":[12,16,28,103,119],"provide":[13],"solution":[15,76],"an":[17,23],"industrial":[18],"scheduling":[19,116],"problem":[20,117],"encountered":[21],"in":[22,53,69,89,109],"aluminium":[24],"foundry.":[25],"An":[26],"endeavour":[27],"enhance":[29],"the":[30,39,46,54,65,80,90,93,105,111,123,127,147],"performance":[31],"of":[32,41,64,92,135],"conventional":[33],"SA":[34,55],"algorithms":[35],"made":[37],"by":[38,61,156],"aid":[40],"new":[43,106],"operator":[44,49,58],"namely":[45],"kin":[47],"selection":[48],"which":[50],"embedded":[52],"algorithm.":[56],"This":[57],"inspired":[60],"phenomenon":[63],"same":[66],"name":[67],"observed":[68],"evolutionary":[70],"systems.":[71],"By":[72],"sacrificing":[73],"better":[75,151],"for":[77,131],"its":[78],"\u2018kin\u2019,":[79],"ensures":[82],"more":[84],"efficiently":[85],"guided,":[86],"thorough":[87],"search":[88],"neighbourhood":[91],"best":[94,128],"solution.":[95],"Comprehensive":[96],"theoretical":[97],"and":[98],"experimental":[99],"analysis":[100],"provided":[102,155],"prove":[104],"operator's":[107],"efficacy":[108],"enhancing":[110],"SA's":[112],"performance.":[113],"related":[118],"foundry":[121],"unit,":[122],"proposed":[124,148],"seeks":[126],"processing":[129],"sequence":[130],"certain":[133],"number":[134],"orders":[136],"on":[137],"parallel":[138],"furnaces.":[139],"After":[140],"extensive":[141],"computations,":[142],"it":[143],"found":[145],"that":[146,154],"provides":[150],"solutions":[152],"than":[153],"other":[157],"established":[158],"combinatorial":[159],"optimization":[160],"tools.":[161]},"counts_by_year":[],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}
