{"id":"https://openalex.org/W2888228490","doi":"https://doi.org/10.1504/ijcaet.2018.10015505","title":"A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment","display_name":"A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2888228490","doi":"https://doi.org/10.1504/ijcaet.2018.10015505","mag":"2888228490"},"language":"en","primary_location":{"id":"doi:10.1504/ijcaet.2018.10015505","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2018.10015505","pdf_url":null,"source":{"id":"https://openalex.org/S5114360","display_name":"International Journal of Computer Aided Engineering and Technology","issn_l":"1757-2657","issn":["1757-2657","1757-2665"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Aided Engineering and Technology","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":null,"display_name":"M. Geetha","orcid":null},"institutions":[{"id":"https://openalex.org/I4387153206","display_name":"Solamalai College of Engineering","ror":"https://ror.org/016701m24","country_code":null,"type":"education","lineage":["https://openalex.org/I4387153206"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M. Geetha","raw_affiliation_strings":["Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, 626001 Tamilnadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, 626001 Tamilnadu, India","institution_ids":["https://openalex.org/I4387153206"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081311063","display_name":"M.K. Marichelvam","orcid":"https://orcid.org/0000-0002-8506-8316"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M.K. Marichelvam","raw_affiliation_strings":["Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, 626005 Tamilnadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, 626005 Tamilnadu, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5049,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73119431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"10","issue":"6","first_page":"636","last_page":"636"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9904000163078308,"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.989300012588501,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8152982592582703},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7678146362304688},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6994635462760925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6099614500999451},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5468206405639648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5269920229911804},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4731810390949249},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4716433882713318},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45921963453292847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31108197569847107}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8152982592582703},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7678146362304688},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6994635462760925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6099614500999451},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468206405639648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5269920229911804},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4731810390949249},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4716433882713318},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45921963453292847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31108197569847107},{"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},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcaet.2018.10015505","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2018.10015505","pdf_url":null,"source":{"id":"https://openalex.org/S5114360","display_name":"International Journal of Computer Aided Engineering and Technology","issn_l":"1757-2657","issn":["1757-2657","1757-2665"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Aided Engineering and Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"In":[0],"this":[1,36,161],"paper,":[2],"flow":[3,32],"shop":[4],"scheduling":[5,80,174],"problems":[6],"which":[7],"were":[8],"proved":[9],"to":[10,23,61,117,171],"be":[11],"strongly":[12],"NP-hard":[13],"(non-deterministic":[14],"polynomial":[15],"time":[16],"hard)":[17],"are":[18,54,85,101,114,127],"considered.":[19],"The":[20,94,125],"objective":[21],"is":[22,48,75,162],"minimise":[24],"the":[25,51,57,63,69,72,83,98,105,119,122,135,138,141,144,156,163,173],"weighted":[26],"sum":[27],"of":[28,68,71,121,143,149,158,167],"makespan":[29],"and":[30,82,91,108,137,152],"total":[31],"time.":[33,154],"For":[34],"solving":[35],"problem,":[37],"a":[38],"recently":[39],"developed":[40],"meta-heuristics":[41,132],"algorithm":[42,47,60,74,100,146,170],"called":[43],"as":[44],"crow":[45,58,168],"search":[46,59,169],"proposed.":[49],"Moreover,":[50],"dispatching":[52,89,106],"rules":[53,90,107],"hybridised":[55],"with":[56,87,129],"improve":[62],"solution":[64,150],"quality.":[65],"An":[66],"evaluation":[67],"performance":[70,120],"proposed":[73,99,123,145],"carried":[76],"out":[77],"by":[78,97],"industrial":[79],"problem":[81,112],"results":[84,95,126,139],"compared":[86,128],"many":[88,130],"constructive":[92,109],"heuristics.":[93,110],"obtained":[96],"much":[102],"better":[103],"than":[104],"Random":[111],"instances":[113],"also":[115],"used":[116],"validate":[118],"algorithm.":[124],"other":[131],"addressed":[133],"in":[134,147],"literature":[136],"indicate":[140],"effectiveness":[142],"terms":[148],"quality":[151],"computational":[153],"To":[155],"best":[157],"our":[159],"knowledge":[160],"first":[164],"reported":[165],"application":[166],"solve":[172],"problems.":[175]},"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}