{"id":"https://openalex.org/W2573642814","doi":"https://doi.org/10.1504/ijcaet.2017.10002533","title":"Scheduling problem solving using genetic and greedy algorithms","display_name":"Scheduling problem solving using genetic and greedy algorithms","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2573642814","doi":"https://doi.org/10.1504/ijcaet.2017.10002533","mag":"2573642814"},"language":"en","primary_location":{"id":"doi:10.1504/ijcaet.2017.10002533","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2017.10002533","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/A5036289856","display_name":"R. Rajkumar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. Rajkumar","raw_affiliation_strings":["Mechanical Engineering Department, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076544486","display_name":"A. Muthiah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Muthiah","raw_affiliation_strings":["Department of Mechanical Engineering, PSR Engineering College, Sivakasi - 626140, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, PSR Engineering College, Sivakasi - 626140, Tamil Nadu, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036289856"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00898144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"207","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9990000128746033,"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.9990000128746033,"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.9793000221252441,"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.9731000065803528,"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/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.6626026630401611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.602993905544281},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5960338711738586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5490959286689758},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5324417352676392},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5135505199432373},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.47090911865234375},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.46890580654144287},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4651642143726349},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4477444291114807},{"id":"https://openalex.org/keywords/batch-production","display_name":"Batch production","score":0.4410005211830139},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2979981601238251},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.23771417140960693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16156387329101562},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.12929272651672363},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11526265740394592}],"concepts":[{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.6626026630401611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.602993905544281},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5960338711738586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5490959286689758},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5324417352676392},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5135505199432373},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.47090911865234375},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.46890580654144287},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4651642143726349},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4477444291114807},{"id":"https://openalex.org/C2776043813","wikidata":"https://www.wikidata.org/wiki/Q1759113","display_name":"Batch production","level":2,"score":0.4410005211830139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2979981601238251},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.23771417140960693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16156387329101562},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.12929272651672363},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11526265740394592},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcaet.2017.10002533","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcaet.2017.10002533","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","score":0.5600000023841858,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W2155809154","https://openalex.org/W2741059494","https://openalex.org/W32630872","https://openalex.org/W4382280829","https://openalex.org/W2533899164","https://openalex.org/W131757205","https://openalex.org/W2057737420","https://openalex.org/W2596081411"],"abstract_inverted_index":{"Scheduling":[0],"is":[1,28,73,91],"an":[2],"important":[3],"tool":[4],"for":[5],"manufacturing":[6],"and":[7,34,46,139],"engineering,":[8],"where":[9],"it":[10],"can":[11,81],"have":[12],"a":[13,20,108],"major":[14],"impact":[15],"on":[16],"the":[17,24,31,41,44,56,97,116,119,122,132,148,151],"productivity":[18],"of":[19,26,43,63,100,111,118,150],"process.":[21],"In":[22,127],"manufacturing,":[23],"purpose":[25],"scheduling":[27,37,134],"to":[29,39,54,67,76,83,106],"minimise":[30],"production":[32,133],"time":[33,99],"costs.":[35,48],"Production":[36],"aims":[38],"maximise":[40],"efficiency":[42],"operation":[45],"reduce":[47],"The":[49],"following":[50],"approaches":[51],"are":[52,124],"used":[53],"solve":[55],"job":[57],"shop":[58],"problem.":[59],"We":[60,80],"keep":[61],"all":[62],"our":[64,85],"machines":[65],"well-maintained":[66],"prevent":[68,78],"any":[69],"problems,":[70],"but":[71],"there":[72],"no":[74],"way":[75],"completely":[77],"down-time.":[79],"work":[82],"get":[84],"batch":[86,123],"sizes":[87],"as":[88,90],"small":[89],"reasonably":[92],"possible":[93],"while":[94,115],"also":[95],"reducing":[96],"setup":[98,145],"each":[101,112],"batch.":[102],"This":[103],"allows":[104],"us":[105],"eliminate":[107],"sizable":[109],"portion":[110],"part":[113],"waiting":[114],"rest":[117],"parts":[120],"in":[121],"being":[125],"machined.":[126],"this":[128],"paper,":[129],"we":[130],"propose":[131],"problem":[135],"solving":[136],"using":[137],"genetic":[138],"greedy":[140],"algorithms":[141],"with":[142],"sequence":[143],"dependant":[144],"times":[146],"considering":[147],"minimisation":[149],"maximum":[152],"completion":[153],"time.":[154]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}