Show simple item record

dc.contributor.authorLi, S.
dc.contributor.authorButterfield, J.
dc.contributor.authorMurphy, A.
dc.date.accessioned2023-11-29T18:55:48Z
dc.date.available2023-11-29T18:55:48Z
dc.date.copyright12/12/2022 12:00:00 AM
dc.date.issued12/12/2022 12:00:00 AM
dc.date.issued2022-12-12
dc.identifier.issn1530-9827
dc.identifier.otherjcise_23_3_034502.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4294469
dc.description.abstractThe aim of this work is to enable a step towards a self-adapting digital toolset for manufacturing planning focusing on minimally constrained assembly line balancing. The approach includes the simultaneous definition of the optimum number of workstations, the optimum cycle time and the assignment of tasks to workstations. A bespoke genetic algorithm (GENALSAS) is proposed and demonstrated which focuses on examining the simple assembly line balancing problem (SALBP). The proposed genetic algorithm (GA) has been shown to consistently deliver detailed production plans for SALBP problem forms with minimum inputs. Neither the number of workstations nor the system cycle time is assumed/fixed as in previous work in the field. The work simultaneously attains better performing solutions compared with previous studies both in terms of time to converge and the quality of the solution.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleA New Multi-Objective Genetic Algorithm for Assembly Line Balancing
dc.typeJournal Paper
dc.journal.volume23
dc.journal.issue3
dc.journal.titleJournal of Computing and Information Science in Engineering
dc.identifier.doi10.1115/1.4055426
dc.journal.fristpage34502-1
dc.journal.lastpage34502-10
dc.page10
dc.treeJournal of Computing and Information Science in Engineering:;2022:;volume( 023 ):;issue: 003
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record