给定序列的混合品种装配生产线平衡算法

针对任意给定序列的混合品种装配生产线平衡问题建立了数学模型,模型中假定不同品种之间可以具有不同的偏序结构和关联任务。为了获得最优的产出效率,模型的目标函数是品种负荷波动产生的剩余工作总量最小。由于该装配生产线平衡问题是NP-hard问题,开发了相应的遗传算法。最后用一个实例来说明算法的有效性。

ALGORITHM FOR BALANCING MIXED-MODEL ASSEMBLY LINES WITH PRE-DEFINED SEQUENCES

The problem of balancing mixed-model assembly line, which has any defined sequences of products, is formulated as a mathematical model. Different precedence structures and relation tasks across models are assumed to exist. In order to achieve the best production throughput, the objective of the model is to minimize the amount of overtime caused by the mixed-load fluctuation. The balancing model is proven to be NP-complete, so a genetic algorithm is developed for the balancing problem. Finally, the efficiency of the genetic algorithm is illustrated by a numerical example.