Show simple item record

contributor authorLi, S.
contributor authorButterfield, J.
contributor authorMurphy, A.
date accessioned2023-11-29T18:55:48Z
date available2023-11-29T18:55:48Z
date copyright12/12/2022 12:00:00 AM
date issued12/12/2022 12:00:00 AM
date issued2022-12-12
identifier issn1530-9827
identifier otherjcise_23_3_034502.pdf
identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4294469
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.
publisherThe American Society of Mechanical Engineers (ASME)
titleA New Multi-Objective Genetic Algorithm for Assembly Line Balancing
typeJournal Paper
journal volume23
journal issue3
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.4055426
journal fristpage34502-1
journal lastpage34502-10
page10
treeJournal of Computing and Information Science in Engineering:;2022:;volume( 023 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record