Data underlying the research of mixed-model parallel two-sided assembly lines balancing problem

The dataset is a classical arithmetic example containing task orientation attributes (Left , Right and free E), task time and task sequential relationships for product processing, see figures: P-9, P-12, P-16, P-24 and P-65, see file: Task time for each model. Prioritization diagrams for classical algorithms were obtained from the literature, and links to the relevant literature are provided in the "References" section. The study aims to solve a class of balancing problems of mixed model parallel two-sided assembly line, and mainly accomplishes the following aspects: (1) Define the "r-q" partition conceptual model of parallel two-sided assembly line with mixed-model, see the file: Assembly line schematic and vector drawing. (2) According to the conceptual model of partitioning, construct a comprehensive priority relationship diagram of products, realize the design of mixed-model production scheduling, and establish the first type of balanced mathematical model of mixed-model parallel two-sided assembly line. (3) For the first time, an ant colony algorithm has been successfully applied to solve the first type of balancing mathematical model of mixed-model parallel two-sided assembly line. (4) The assembly balancing problem of product flow production was calculated by this dataset, and the results include the number of workstations, the number of multiline stations, the number of positions, the balancing rate, and the smoothing index for each algorithm, see the file: study results. The results are compared with those of heuristic algorithm and artificial fish swarm algorithm, and the ant colony algorithm has better computational results, which verifies that the model and algorithm for a class of balancing problems of mixed-model parallel two-sided assembly lines are effective, and solves the joint optimization problem of a complex assembly line system that considers mixed-model sorting and product time balancing.

本数据集为用于产品加工的经典算例，包含任务方位属性（左工位、右工位与自由工位E）、任务时长以及任务时序关系，相关图示见P-9、P-12、P-16、P-24与P-65，各模型的任务耗时详见文件「Task time for each model」。经典算法的优先级关系图源自公开文献，相关文献链接已在「参考文献」章节中给出。
本研究旨在求解一类混流并行双边装配线平衡问题，主要完成以下工作：
(1) 构建混流并行双边装配线的「r-q」分区概念模型，相关装配线原理图及矢量绘图详见文件「Assembly line schematic and vector drawing」；
(2) 基于分区概念模型构建产品综合优先级关系图，实现混流型生产调度设计，并建立混流并行双边装配线的第一类平衡数学模型；
(3) 首次将蚁群算法成功应用于混流并行双边装配线第一类平衡数学模型的求解；
(4) 本数据集用于计算产品流生产的装配平衡问题，计算结果包含各算法对应的工作站数量、多线工位数量、工位数量、平衡率以及平滑指数，相关结果详见文件「study results」。
将所得结果与启发式算法、人工鱼群算法的计算结果进行对比，结果显示蚁群算法具备更优的计算性能，验证了针对混流并行双边装配线平衡问题的模型与算法的有效性，同时解决了兼顾混流排序与产品工时平衡的复杂装配线系统联合优化难题。