{"id":"https://openalex.org/W2573245238","doi":"https://doi.org/10.1504/ijcaet.2017.10002532","title":"Ant-based job shop scheduling with genetic algorithm for makespan minimisation on identical machines","display_name":"Ant-based job shop scheduling with genetic algorithm for makespan minimisation on identical machines","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2573245238","doi":"https://doi.org/10.1504/ijcaet.2017.10002532","mag":"2573245238"},"language":"en","primary_location":{"id":"doi:10.1504/ijcaet.2017.10002532","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2017.10002532","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":"https://openalex.org/A5009499384","display_name":"P. Venkumar","orcid":"https://orcid.org/0000-0003-2743-1962"},"institutions":[{"id":"https://openalex.org/I98499257","display_name":"Kalasalingam Academy of Research and Education","ror":"https://ror.org/04fm2fn75","country_code":"IN","type":"education","lineage":["https://openalex.org/I98499257"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"P. Venkumar","raw_affiliation_strings":["Department of Mechanical Engineering, Kalasalingam University, Krishnankoil, Tamilnadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Kalasalingam University, Krishnankoil, Tamilnadu, India","institution_ids":["https://openalex.org/I98499257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100735035","display_name":"S. Kavitha","orcid":null},"institutions":[{"id":"https://openalex.org/I98499257","display_name":"Kalasalingam Academy of Research and Education","ror":"https://ror.org/04fm2fn75","country_code":"IN","type":"education","lineage":["https://openalex.org/I98499257"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Kavitha","raw_affiliation_strings":["Department of Mechanical Engineering, Kalasalingam University, Krishnankoil, Tamilnadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Kalasalingam University, Krishnankoil, Tamilnadu, India","institution_ids":["https://openalex.org/I98499257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009499384"],"corresponding_institution_ids":["https://openalex.org/I98499257"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00886596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"199","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9868000149726868,"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.9868000149726868,"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.9740999937057495,"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.6801161766052246},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6328074932098389},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6201225519180298},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6029084920883179},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5593067407608032},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.550022304058075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5264607071876526},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5153900384902954},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45597586035728455},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.45007067918777466},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4199554920196533},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.41847503185272217},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.4107879102230072},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35084372758865356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3222951591014862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18485501408576965},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09798139333724976},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09522178769111633},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06946343183517456},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0675111711025238},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.062290042638778687}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6801161766052246},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6328074932098389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6201225519180298},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6029084920883179},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5593067407608032},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.550022304058075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5264607071876526},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5153900384902954},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45597586035728455},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.45007067918777466},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4199554920196533},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.41847503185272217},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.4107879102230072},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35084372758865356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3222951591014862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18485501408576965},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09798139333724976},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09522178769111633},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06946343183517456},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0675111711025238},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.062290042638778687}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcaet.2017.10002532","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2017.10002532","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2155809154","https://openalex.org/W2949165180","https://openalex.org/W2807934311","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2245286458","https://openalex.org/W2184166483","https://openalex.org/W2057737420","https://openalex.org/W2533899164","https://openalex.org/W2596081411"],"abstract_inverted_index":{"The":[0,18,70,84,107,122],"ant-based":[1,21,41],"optimisation":[2],"techniques":[3],"have":[4,102,117],"been":[5],"used":[6,13],"in":[7,14,23,72,97,113],"various":[8],"problems":[9],"and":[10],"could":[11],"be":[12],"job":[15,24,42],"shop":[16,25,43],"scheduling.":[17],"application":[19],"of":[20,33,57,130],"method":[22],"scheduling":[26,44,56,67,112],"is":[27,49,77,90,124],"to":[28,80,92,103,118,125],"find":[29,93],"out":[30,94],"the":[31,64,68,73,81,95,100,127,132],"sequence":[32],"jobs":[34,58],"with":[35,46,59,87,105],"low":[36,60],"time":[37,62,82,129],"complexity.":[38,83],"A":[39],"new":[40,74],"algorithm":[45,48,76,86,109],"genetic":[47,75,85],"proposed":[50,91,108],"using":[51],"support,":[52],"which":[53,98,114],"generates":[54],"a":[55],"waited":[61],"for":[63],"processes":[65,101,116],"while":[66],"jobs.":[69],"support":[71,88],"inversely":[78],"proportional":[79],"function":[89],"path":[96],"all":[99,115,131],"service":[104],"resources.":[106],"produces":[110],"optimal":[111],"wait":[119],"minimum":[120],"time.":[121],"problem":[123],"reduce":[126],"waiting":[128],"processes.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}