{"id":"https://openalex.org/W7118829953","doi":"https://doi.org/10.48550/arxiv.2601.00689","title":"Cost Optimization in Production Line Using Genetic Algorithm","display_name":"Cost Optimization in Production Line Using Genetic Algorithm","publication_year":2026,"publication_date":"2026-01-02","ids":{"openalex":"https://openalex.org/W7118829953","doi":"https://doi.org/10.48550/arxiv.2601.00689"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.00689","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00689","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.00689","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122088484","display_name":"Alireza Rezaee","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rezaee, Alireza","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5122088484"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.491100013256073,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.491100013256073,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.14800000190734863,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.1307000070810318,"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/scheduling","display_name":"Scheduling (production processes)","score":0.5906999707221985},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5699999928474426},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.544700026512146},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4918000102043152},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.48030000925064087},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.43619999289512634},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42750000953674316},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.3955000042915344}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.661899983882904},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5906999707221985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5803999900817871},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5699999928474426},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.544700026512146},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.48030000925064087},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.43619999289512634},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3456999957561493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3393999934196472},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.29660001397132874},{"id":"https://openalex.org/C2780682718","wikidata":"https://www.wikidata.org/wiki/Q16321575","display_name":"Production control","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C99862985","wikidata":"https://www.wikidata.org/wiki/Q10858068","display_name":"Production line","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.00689","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00689","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.00689","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00689","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,13,20,28,49,64,88,101],"genetic":[4],"algorithm":[5],"(GA)":[6],"approach":[7],"to":[8,41,48,56,124],"cost-optimal":[9],"task":[10,68],"scheduling":[11,186],"in":[12,104,189],"production":[14,60],"line.":[15],"The":[16,53,172],"system":[17],"consists":[18],"of":[19,22,45,67,139,167,177,192],"set":[21],"serial":[23],"processing":[24],"tasks,":[25],"each":[26,112],"with":[27,96],"given":[29],"duration,":[30],"unit":[31],"execution":[32],"cost,":[33,61],"and":[34,70,79,100,120,127,145,154,181,195],"precedence":[35,140],"constraints,":[36],"which":[37,105],"must":[38],"be":[39],"assigned":[40],"an":[42],"unlimited":[43],"number":[44,166],"stations":[46],"subject":[47],"per-station":[50],"duration":[51,72],"bound.":[52],"objective":[54],"is":[55,170],"minimize":[57],"the":[58,71,93,129,148,160,165,175,190],"total":[59],"modeled":[62],"as":[63],"station-wise":[65],"function":[66],"costs":[69],"bound,":[73],"while":[74],"strictly":[75],"satisfying":[76],"all":[77],"prerequisite":[78],"capacity":[80],"constraints.":[81],"Two":[82],"chromosome":[83],"encoding":[84,150],"strategies":[85],"are":[86,122],"investigated:":[87],"station-based":[89,161],"representation":[90,103],"implemented":[91],"using":[92],"JGAP":[94],"library":[95],"SuperGene":[97],"validity":[98],"checks,":[99],"task-based":[102,149],"genes":[106],"encode":[107],"station":[108],"assignments":[109],"directly.":[110],"For":[111],"encoding,":[113,162],"standard":[114],"GA":[115,178],"operators":[116],"(crossover,":[117],"mutation,":[118],"selection,":[119],"replacement)":[121],"adapted":[123],"preserve":[125],"feasibility":[126],"drive":[128],"population":[130],"toward":[131],"lower-cost":[132],"schedules.":[133],"Experimental":[134],"results":[135],"on":[136],"three":[137],"classes":[138],"structures-tightly":[141],"coupled,":[142,144],"loosely":[143],"uncoupled-demonstrate":[146],"that":[147],"yields":[151],"smoother":[152],"convergence":[153],"more":[155],"reliable":[156],"cost":[157,197],"minimization":[158],"than":[159],"particularly":[163],"when":[164],"valid":[168],"schedules":[169],"large.":[171],"study":[173],"highlights":[174],"advantages":[176],"over":[179],"gradient-based":[180],"analytical":[182],"methods":[183],"for":[184],"combinatorial":[185],"problems,":[187],"especially":[188],"presence":[191],"complex":[193],"constraints":[194],"non-differentiable":[196],"landscapes.":[198]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}