{"id":"https://openalex.org/W4404031709","doi":"https://doi.org/10.1109/icccnt61001.2024.10724298","title":"Scheduling of Flexible Manufacturing System with Penalty Cost Using Simulated Genetic Algorithm","display_name":"Scheduling of Flexible Manufacturing System with Penalty Cost Using Simulated Genetic Algorithm","publication_year":2024,"publication_date":"2024-06-24","ids":{"openalex":"https://openalex.org/W4404031709","doi":"https://doi.org/10.1109/icccnt61001.2024.10724298"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt61001.2024.10724298","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icccnt61001.2024.10724298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT)","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/A5101480666","display_name":"V. K. Singh","orcid":"https://orcid.org/0000-0002-7457-5435"},"institutions":[{"id":"https://openalex.org/I26072440","display_name":"Indian Institute of Information Technology Allahabad","ror":"https://ror.org/03rgjt374","country_code":"IN","type":"education","lineage":["https://openalex.org/I26072440"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vijai Singh","raw_affiliation_strings":["Inderprastha Engineering College,dept. of Computer Science and Engineering,Ghaziabad,Uttar Pradesh,India","Indian Institute of Information Technology Allahabad,dept. of Information Technology,Prayagraj,Uttar Pradesh,India"],"affiliations":[{"raw_affiliation_string":"Inderprastha Engineering College,dept. of Computer Science and Engineering,Ghaziabad,Uttar Pradesh,India","institution_ids":[]},{"raw_affiliation_string":"Indian Institute of Information Technology Allahabad,dept. of Information Technology,Prayagraj,Uttar Pradesh,India","institution_ids":["https://openalex.org/I26072440"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101983118","display_name":"Varsha Singh","orcid":"https://orcid.org/0000-0003-4777-1278"},"institutions":[{"id":"https://openalex.org/I26072440","display_name":"Indian Institute of Information Technology Allahabad","ror":"https://ror.org/03rgjt374","country_code":"IN","type":"education","lineage":["https://openalex.org/I26072440"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Varsha Singh","raw_affiliation_strings":["Inderprastha Engineering College,dept. of Computer Science and Engineering,Ghaziabad,Uttar Pradesh,India","Indian Institute of Information Technology Allahabad,dept. of Information Technology,Prayagraj,Uttar Pradesh,India"],"affiliations":[{"raw_affiliation_string":"Inderprastha Engineering College,dept. of Computer Science and Engineering,Ghaziabad,Uttar Pradesh,India","institution_ids":[]},{"raw_affiliation_string":"Indian Institute of Information Technology Allahabad,dept. of Information Technology,Prayagraj,Uttar Pradesh,India","institution_ids":["https://openalex.org/I26072440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101480666"],"corresponding_institution_ids":["https://openalex.org/I26072440"],"apc_list":null,"apc_paid":null,"fwci":0.3693,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66664272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9915000200271606,"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.9915000200271606,"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.9585000276565552,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9254999756813049,"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.688488245010376},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5479854345321655},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5095282196998596},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.47437602281570435},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.413921058177948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41202616691589355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3920508623123169},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.12308531999588013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12120553851127625}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.688488245010376},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5479854345321655},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5095282196998596},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.47437602281570435},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.413921058177948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41202616691589355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3920508623123169},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.12308531999588013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12120553851127625},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt61001.2024.10724298","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icccnt61001.2024.10724298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W164670375","https://openalex.org/W1506527095","https://openalex.org/W1518750221","https://openalex.org/W2030852225","https://openalex.org/W2064661781","https://openalex.org/W2068502911","https://openalex.org/W2076903451","https://openalex.org/W2084402702","https://openalex.org/W2108767121","https://openalex.org/W2125367223","https://openalex.org/W2133638566","https://openalex.org/W2593221340","https://openalex.org/W2600919338","https://openalex.org/W2993791861","https://openalex.org/W6729388055"],"related_works":["https://openalex.org/W2018662469","https://openalex.org/W2109185638","https://openalex.org/W2098882706","https://openalex.org/W1988507758","https://openalex.org/W2048756781","https://openalex.org/W3204654320","https://openalex.org/W2347558389","https://openalex.org/W122341662","https://openalex.org/W2106069570","https://openalex.org/W4285154570"],"abstract_inverted_index":{"This":[0,56],"paper":[1,57,89],"discuss":[2],"about":[3],"the":[4,13,18,52,66,73,77,104,121,138,148],"scheduling":[5,32,54,67],"problem":[6,68],"for":[7,134],"flexible":[8],"manufacturing":[9],"systems":[10],"(FMSs)":[11],"using":[12],"genetic":[14,92,122],"algorithm.":[15],"In":[16,41,102,126],"FMSs,":[17],"operation":[19],"of":[20,69,86,120],"a":[21,37,62,84,91,99,112],"job":[22],"is":[23,33,132],"performed":[24],"on":[25],"more":[26],"than":[27],"one":[28],"machine.":[29],"Therefore,":[30],"FMS":[31,53,135],"considered":[34],"to":[35,51,60,65,83,97],"be":[36,81],"computationally":[38],"hard":[39],"problem.":[40,55],"this":[42,88,127],"paper,":[43],"various":[44,78],"approaches":[45],"are":[46,49,124],"reviewed":[47],"that":[48],"applied":[50],"also":[58],"attempts":[59],"find":[61],"possible":[63],"solution":[64],"FMS.":[70],"To":[71,110],"identify":[72],"order":[74],"in":[75],"which":[76],"jobs":[79],"would":[80],"assigned":[82],"number":[85],"machines,":[87],"uses":[90],"algorithm":[93,123],"with":[94,114],"Simulated":[95],"Annealing":[96],"generate":[98],"machine":[100],"sequence.":[101],"this,":[103],"developed":[105],"tool":[106],"requires":[107],"tabular":[108],"input.":[109],"obtain":[111],"schedule":[113,131],"minimum":[115,142,149],"make":[116],"span,":[117],"many":[118],"iterations":[119],"applied.":[125],"system,":[128],"an":[129],"optimal":[130],"given":[133],"by":[136],"taking":[137],"makespan":[139],"time":[140],"and":[141,145],"penalty":[143],"cost,":[144],"therefore":[146],"calculating":[147],"combined":[150],"objective":[151],"function.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}