工作站
定制
遗传算法
计算机科学
装配线
算法
领域(数学)
工作(物理)
工业工程
简单(哲学)
数学优化
分布式计算
实时计算
工程类
数学
操作系统
机器学习
机械工程
哲学
认识论
政治学
法学
纯数学
作者
Shenglin Li,Joseph Butterfield,Adrian Murphy
摘要
Abstract The 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI