基于启发式算法的电控板装配线线平衡优化

为了解决人员配置不稳定而导致的工位作业负荷不平衡问题,以某电控板装配企业为对象,构建其电控板装配线生产模型和线平衡优化模型。在该优化模型中,将约束条件转化为启发式规则,改进模型的参数设置和处理过程,将该模型转化为可求解的启发式算法。以该企业某电控装配线为例,通过线平衡优化实验证明该模型有效提高产量和线平衡率,说明该模型是有效和实用的。     

A MILP model for the Accessibility Windows Assembly Line Balancing Problem (AWALBP)

This work studies a novel assembly line balancing problem that has recently appeared in the literature, which we name Accessibility Windows Assembly Line Balancing Problem (AWALBP). AWALBP is a real-world industrial problem that arises in those assembly lines where, as opposed to the most common ones, the length of the workpiece is larger than the widths of the workstation. This means that, at any time, a workstation cannot access one whole workpiece, but only a restricted portion of one or two consecutive workpiece. In our problem the cycle decomposes into stationary stages separated by forward steps, according to a cyclic movement scheme. The aim of this paper is (i) to formalise the AWALBP and its variants, and (ii) to propose a Mixed Integer Linear Programming (MILP) model using two alternative formulations to solve the variant AWALBP-L2. This variant involves solving the task assignment and the movement scheme sub-problems (with the objective of minimising the cycle time). An extensive computational experiment is carried out to study the behaviour of the proposed model for different instance sizes. To the best of our knowledge, this is the first work in the literature which provides optimal solutions for AWALBP-L2. In addition, a set of benchmark instances is provided, which can be further used by the research community.     

随机型双边装配线平衡问题的一种启发式算法

为有效求解随机型双边装配线第Ⅰ类平衡问题(STALBP 1),在分析双边装配线平衡特点的基础上,考虑各任务操作时间的随机性,提出了一种启发式算法。在该启发式算法中,假定各任务的操作时间服从正态分布,运用具有操作方位约束的任务优先分配等规则来进行任务的选择和分配,通过改变预设超限概率,在不同生产节拍下,分别得到不同的平衡方案。实例验证了算法的有效性。     

随机混合装配线的启发式平衡设计方法

把某个型号产品的数量占整个批次的比重作为它的权重,加权合并混合装配线上各个型号产品的同类型工作单元的时间.运用随机启发式方法对合并后的工作单元进行平衡排序,通过改变预设超限概率的值,获得一组排序方案.采用工作站总数、装配线效率、平滑指数和成本四个指标对这组排序方案进行综合评价,挑选出最佳的排序方案,并且用系统仿真来检验该最佳方案的实际运作效果.实证研究表明,各个工作站的平均等待时间和空闲率都有明显的下降.     

多类约束下U型装配线平衡建模研究

现有针对U型装配线平衡问题的研究假设除了节拍约束和任务间的优先顺序关系外,不存在其它约束,实际上受生产环境、产品设计、工艺要求以及人因等多种因素的制约,在对U型装配线进行优化设计时还需满足其它约束,将各种表象不同的约束抽象为相连、相斥、相关以及工作站属性约束四类,针对多类约束下U型装配线平衡问题建立了整数规划模型,通过...     

基于eM-plant的水洗机装配线平衡分析

介绍了精益生产理念及其在制造企业中的应用,以水洗机制造企业中总装车间的装配线为例,借助于面向对象的eM-plant软件,运用装配线平衡方法,对装配线进行单件流与连续流的改造,并分别对其进行了节拍平衡.利用eM-plant对改造结果进行快速仿真,来分析占地面积、工人利用率、产量的控制和工厂管理等状况,以辅助企业管理者正确决策.讨论仿真技术作为一个重要的分析手段,在广大制造企业转变生产方式中的应用.     

求解考虑顺序相关调整时间的双边装配线平衡问题的变邻域搜索算法

为有效解决带有顺序相关调整时间的双边装配线平衡问题,提出了一种简单高效的变邻域搜索算法。该算法通过将优先关系约束融入到交换、插入、交叉、变异等算子中,分别得到4个不同的邻域结构来保证搜索过程中解的可行性,避免过多重复邻域解的生成。4个邻域结构的搜索空间依次变大,以增强算法搜索能力。同时,结合装配线的特点,提出基于作业序列的编码和解码方式,在解码过程中,优先选择空闲时间较多的边,引入启发式目标加快算法收敛。分配结束后,对装配线末端的工作站组进行局部调整。通过将该算法先后用于求解无/有顺序相关调整时间的双边装配线平衡第一类问题,并与已有的算法进行对比,验证了所提的变邻域搜索算法的优越性和有效性。     

A Trainable Heuristic Procedure for the Assembly Line Balancing Problem

This paper examines the development of a solution procedure for many types of combinatorial problems. The technique known as the trainable heuristic procedure uses algorithmic procedures to gain experience on heuristic approaches to combinatorial problems. The synergistic combination of these approaches leads to a learning mechanism which has proven very effective in the solution of the assembly line balancing problem.     

玩具厂装配流水线的瓶颈分析与平衡改善

运用工作测定与作业分析的方法,分析了某玩具厂装配流水线的工作过程与平衡状况,针对整条流水线中存在问题,结合生产实际提出了解决装配流水线瓶颈环节、改进流水线平衡的方案.通过实施改进方案,工序总数减少了3道, 瓶颈工作时间降低了4 s,装配流水线负荷效率提高了34.7%.     

飞机移动生产线作业调度问题的启发式算法

飞机移动生产线作业调度问题是一种具有特殊约束的项目调度问题。综合分析了飞机移动生产线的作业顺序关序、资源约束、空间限制的多重特点,建立了以最小装配完工时间为目标的模型。将问题分为确定作业的优先顺序和选择作业人数的两个阶段进行决策,设计了由不同规则组合成27种启发式方法。通过比较启发式方法在250个测试问题集的表现,确定最有效的解决此问题的方法。     

商用车组装线平衡及案例研究

针对某商用车有限公司组装线自动化程度不高、作业繁杂的现状,应用三项原则对其予以简化,根据组装线平衡理论进行建模,在不改变原组装线布局基础上,采用重要位置排序法初始化作业分配方案,通过作业交换和转移操作,设置合理的参数数值,进行迭代优化.所得结果可大幅提高生产率;另外通过改进组装线布局,生产率可得到进一步提高.     

A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options

Mixed-model assembly nowadays is a common practice in the automobile industry. In an automobile assembly plant, many car options often need to be considered in sequencing an assembly line, for example, the multiple sequencing objectives that consider a pattern, blocking, spacing, and smoothing of options. A general heuristic procedure is developed in this paper for sequencing automobile assembly lines considering multiple options. The procedure obtains an initial sequence by an enhanced constructive procedure, swaps orders for the most deteriorating category of objectives, and performs re-sequencing attempting to improve the swapped sequence. The heuristic procedure was shown to frequently improve the initial sequences by swapping and re-sequencing when swapping opportunities exist. A further improvement step is also proposed to perform a limited search based on the swapped solution. The limited-search improvement step was shown to be effective in further improving solutions from the heuristic procedure in the computational experimentation. Solutions from the heuristic procedure in conjunction with the limited-search improvement step were compared to those from the simulated annealing procedure for large-size problems and showed relatively positive results.     

基于JIT的流水线生产效率提升方法研究

以某线缆自动生产线为研究对象,针对生产线不均衡、在制品库存量大、生产效率不能满足客户需求等问题,提出了基于JIT的改善方案。灵活运用山积表、物与信息流动图等工具对生产线进行分析,改善后生产线平衡率由原来的70.97%提高到83.3%,并将看板方式引入该生产线,实现拉动生产,生产过程周期(Lead Time)由原来的19.1天降低到7.6天。     

基于Lingo的汽车装配线建模与平衡研究

本文对汽车装配线的两类平衡问题进行研究,通过线性规划,建立了装配线平衡的数学模型;并将所建立的数学模型应用于某汽车集团的汽车底盘装配线。具体步骤为：将装配内容转化为作业顺序优先关系图,并将相关装配数据存入文本文件,然后利用LING08．0根据以上两个数学模型进行编程,分别求出了最小工位数和最优生产节拍,最后用平衡延迟指标进行判断,从而确定是否满足平衡要求。     

考虑转换约束的汽车混流装配线投产排序研究

讨论了有生产线线边替补人员协助完成超载工作量的情况下,汽车混流装配线投产排序的问题,并且考虑工作人员行走占用的时间。通过对某整车厂进行实地调研,将汽车装配生产中的优化问题从以往文献中只考虑的总装车间向前延伸到涂装车间,给出连续喷涂某种颜色的车辆数的上界s。在此基础上,并考虑总装线线边物料消耗速率波动均衡和子装配工负荷均衡的约束条件,建立涂装切换成本和总装车间人工成本最小化的数学模型。最后,用CPLEX对模型进行优化求解,并分析得出生产节拍和工作站长度等参数与总成本之间的变化关系。     

基于价值流图的抽油杆生产线平衡优化研究

以价值流图为工具对Z厂抽油杆流水线存在的平衡率低、物流信息流不合理等问题进行了分析,并运用价值流改善方法进行了工序重组,引入拉动系统控制生产节奏,采取混流生产以提高作业的连续性和均衡性.在此基础上,用工时均衡手法优化工序瓶颈,使生产线工序数目减少了29.4％,生产线平衡率提高了24.3％,制造周期缩短了55.3％,有效地提高了生产效率.     

A Fuzzy AHP and PROMETHEE method-based heuristic for disassembly line balancing problems

Nowadays, new products have been introduced in the market at an ever increasing pace due to rapid technology advancement. Consequently, products are becoming outdated and discarded faster than ever before. Since the demand for new solutions to economically deal with such outdated products begun to rise, the disassembly line has emerged as a viable solution to this problem. The disassembly line has been considered as a viable choice for automated disassembly of returned products. The problem of sequence generation in disassembly is complex due to its NP-Hard nature and therefore the heuristically solutions are most preferable for these types of problems. In this paper, a heuristic has been proposed to assign the disassembly tasks/parts to the work stations under its precedence constraints. It incorporates Fuzzy analytic hierarchy process (Fuzzy AHP) and PROMETHEE method for the selection of tasks for assignment to the disassembly line. The Fuzzy AHP has been used to find the relative importance of each criteria and PROMETHEE method has been used for prioritising the tasks for assignment. The proposed heuristics has been illustrated with an example and the results have been compared to the heuristic proposed by McGovern and Gupta. The proposed heuristic performs well and has shown improvements in terms of cycle time and idle time of the workstations.     

An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem

This article presents an efficient heuristic placement algorithm, namely, a bidirectional heuristic placement, for solving the two-dimensional rectangular knapsack packing problem. The heuristic demonstrates ways to maximize space utilization by fitting the appropriate rectangle from both sides of the wall of the current residual space layer by layer. The iterative local search along with a shift strategy is developed and applied to the heuristic to balance the exploitation and exploration tasks in the solution space without the tuning of any parameters. The experimental results on many scales of packing problems show that this approach can produce high-quality solutions for most of the benchmark datasets, especially for large-scale problems, within a reasonable duration of computational time.     

运用改进蚁群算法求解直线型和U型装配线平衡问题

针对直线型和U型装配线第一类平衡问题,提出一种基于最优成分信息素更新规则的改进蚁群算法。算法在任务和工作站之间释放信息素,综合利用多种优先权规则作为启发式信息,在解构造中加入下界检查,在全局信息素更新中仅对本次迭代最优解中的最优成分释放信息素,既保留了最优解信息,又增加了探索更优解可能。仿真对比实验表明了该算法的有效性。     

A priority rule-based constructive heuristic and an improvement method for balancing assembly lines with parallel multi-manned workstations

Assembly lines of big-size products such as buses, trucks and helicopters are very different from the lines studied in the literature. These products’ manufacturing processes have a lot of tasks most of which have long task times. Since traditional assembly line models including only one worker in each station (i.e. simple assembly lines) or at most two workers (two-sided assembly lines) may not be suitable for manufacturing these type of products, they need much larger shop floor for a number of stations and long product flow times. In this study, an assembly line balancing problem (ALBP) with parallel multi-manned stations is considered. Following the problem definition, a mixed integer programming formulation is developed. A detailed study of priority rules for simple ALBPs is also presented, and a new efficient constructive heuristic algorithm based on priority rules is proposed. In order to improve solutions found by the constructive heuristic, a genetic algorithm-based solution procedure is also presented. Benchmark instances in the literature are solved by using the proposed mathematical programming formulation. It has been seen that only some of the small-size instances can be solved optimally by this way. So the efficiency of the proposed heuristic method is verified in small-size instances whose optimal solutions are found. For medium- and big-size instances, heuristics’ results and CPU times are demonstrated. A comparative evaluation with a branch and bound algorithm that can be found in the literature is also carried out, and results are presented.