Multi-criteria sequencing problem in mixed-model synchronous assembly lines

Mixed-model synchronous assembly line (MMSAL) is a type of assembly line that can be found in the production of large household appliances (e.g., washing machines, dryers, etc.). In this assembly line, products that are simultaneously processed on the line are transferred to the next station at the same time. In this paper, the sequencing problem of MMSAL with three objectives: (1) total idle cost, (2) total production rate variation cost, and (3) total setup cost is simultaneously studied. These three objectives are first weighted by their relative importance weights and a mathematical model is proposed for the problem. Since this problem is well known as non-deterministic polynomial-time hard class, a meta-heuristic algorithm based on simulated annealing is proposed to solve it. Performance of the proposed algorithm is compared against the Lingo 9 software. The computational results validate the efficiency and effectiveness of the proposed algorithm.     

一类新的混流装配线排产优化模型

针对混流装配线的负荷均衡化问题,建立了最优化辅助工人数量的一类新的排产优化模型,分析了混流装配线的空间间隔约束和能力约束之间的关系,让明了空间间隔约束是满足工作站能力约束的充分条件.在此基础上给出了有辅助工人参与情况下的空间间隔约束不等式.对一些非线性约束进行了线性化处理,从而可以方便地求解模型.最后,通过仿真实例验让了该方法的可行性和有效性.     

混流装配线平衡分析与算法设计

为了设计合理可靠的混流装配线并有效地提高装配线的平衡率,分析了混流装配线的特点并设计了一种以工序对调为核心思想的新算法,该算法的逻辑结构较为简易且兼容性高,能够与现有的大部分投产排序方法相结合,对装配线做进一步平衡优化处理.具体地描述了新算法的原理和执行过程,最后将该算法应用到某厂的汽车车灯线束装配线上,结果验证了该方法的有效性和可行性.     

面向防错的混合装配线物流监控

从装配过程的物流控制角度出发,提出了混合装配线主物流和辅助物流的控制策略和方法,给出了详细的数学模型。设计实现了基于装配过程物流控制的防错方法,提供了提高装配质量的手工混合装配线防错控制系统。结合某企业的变速器装配线,给出了系统的应用说明。     

基于禁忌粒子群算法的混流装配线排序研究

为了更好地解决开放式作业域的混流装配线排序问题,建立了以最小化超载时间与平顺化零部件消耗为优化目标的混流装配线排序问题数学模型,并提出了一种禁忌粒子群算法求解该排序问题。针对标准粒子群算法在算法后期搜索精度不足以及容易陷入局部最优不能跳出的缺陷,引入了禁忌搜索算法建立了对最优微粒的重搜索机制来提高算法跳出局部最优的能力,同时给出了禁忌算法中候选解、禁忌表长度、禁忌对象、藐视准则的设置方法,并采用了随机权重的惯性权重更新方式来平衡算法的全局和局部搜索能力,最后建立了禁忌粒子群的算法流程。通过比较禁忌粒子群算法与遗传算法的实例计算结果,验证了禁忌粒子群算法在求解开放式作业域的混流装配线排序问题中的有效性和优越性。     

Considering the conveyer stoppages in sequencing mixed-model assembly lines by a new fuzzy programming approach

Mixed-model production is the practice of assembling different and distinct models in a line without changeovers with responding to sudden demand changes for a variety of models. In this paper, we specify sequence of models to minimize conveyer stoppages. We assume that our lines are fixed and we cannot change the balance of the lines. When the condition of lines like setup cost and demand of each model change, it is important to specify the sequence for minimizing the conveyer stoppages without balancing the line again because the main lines are fixed. We consider three objective functions simultaneously: minimizing the variation in the actual and required production capacity of the line and minimizing the objectives which increase the chance of conveyer stoppage, including: (a) minimizing the total setup time, (b) minimizing the total production variation cost, and (c) minimizing the total utility work cost. Because of conflicting objectives, we propose the fuzzy goal programming-based approach to solve the model. Finally, we present an estimator for nearness of conveyer stoppages and study about affecting of sub-lines and changing the conveyer velocity in a station for reducing stoppages.     

Simulation of mixed-model PCB assembly lines with group setup and bypass conveyors

Recent technological innovations, namely the development of new solder pastes with increased tack life and the introduction of bypass conveyors, facilitate the use of mixed-model lines in printed circuit board (PCB) assembly. This paper presents a simulation study comparing PCB assembly lines operating in conventional batch and in mixed-model assembly mode. For the latter case, a novel group setup strategy is developed. In the first stage, component types and placement operations for each type of PCB are assigned to the machines in the assembly line with the objective of balancing the workload. In the second stage, PCB types with similar component requirements are clustered into setup families. In addition, the feeder-slot assignment for each setup family and the sequence of placement operations for each PCB type are determined. In the final stage, a cyclical mixed-model production schedule is established. The performance of the proposed solution approach is evaluated by means of a simulation study. Two alternative material flow systems are investigated: a serial conveyor which directly links one machine to the other and a flexible one that allows to bypass downstream machines in the line.     

Sequencing the mixed-model assembly line to minimize the total utility and idle costs with variable launching interval

A mixed-model assembly line (MMAL) is a type of a production line where a variety of products is assembled on it. A mixed-model assembly line problem involves not only solving the traditional problems of the assembly line design (i.e., determining the cycle time, the number and sequence of stations, and the balancing problem) but also determining the sequence of products in assembly line. The product sequencing has a high effect on the mixed-model assembly line efficiency. In this paper, we consider sequencing problem with a variable launching interval between products on the assembly line. A mathematical model is presented, which is capable to solve the small-sized ones of these problems. The considered problem involves two optimization problems (the sequencing problem and launching interval problem). Since this problem is strongly NP-hard, a hybrid metaheuristic algorithm based on the simulated annealing approach and a heuristic approach is developed. The heuristic approach (launching interval between products algorithm) is presented to solve the launching interval problem for each sequence. Numerical experiments are used to evaluate the performance and effectiveness of the proposed algorithm. Variable launching interval consideration in MMAL problem causes the higher complexity of this problem. However, this assumption improves the considered goals for this problem. Not only a power algorithm for MMAL is presented in this paper but also the effect of this assumption is discussed. Numerical experiments are used to evaluate the performance and effectiveness of the proposed algorithm.     

以成本优化为平台的混流装配线排序

随着客户需求的日益多样化,混流装配线在工业生产中得到越来越多的应用.为了降低混流装配线的闲置和超载现象带来的成本浪费,在分析混流装配线的闲置和超载成本的基础上,提出一种最小化闲置和超载成本的排序模型,并应用粒子群算法来进行优化.优化综合考虑了粒子群算法中惯性权值的关键作用,给出了一种模糊自适应的惯性权值调整方法.最后将优化模型及算法应用到具体的混流装配线,验证了该方法的有效性.这种排序方法可以降低企业的生产成本,从而提高企业的效益,在企业内具有实际的应用价值.     

混流汽车总装配线上的零部件优化配送方案研究

配送车每次配送的利用率大小是提高配送效率的主要因素,因此设计一种启发式算法使配送车一次装载的标准塑料周转箱尽可能多,提高配送车空间利用率.最后的仿真实验验证了上述配送方法的实用性,提出的零部件配送管理方法,只需使用较少的配送工人,同时降低了线旁库存,能为企业节省人力,降低生产成本.     

Optimization of workcell layouts in a mixed-model assembly line environment

Mixed-model assembly lines enable automotive manufacturers to build different vehicles using the same equipment and facility. They allow a more rapid response to changes in customer demand. However, the increased production flexibility creates new challenges regarding assembly line planning and balancing. Part of this problem is how to allocate stock within the workcells so that non-value added operations, such as walking and waiting, are minimized. This paper addresses the issue of workstation layout optimization. Different formulations can be used to minimize non-value added time depending on the level of sophistication desired. We present three different optimization formulations and give an example of an optimized workstation layout.     

基于数字孪生的混流装配线资源配置优化

针对混流装配线资源配置优化效率低、时效性差、动态响应能力不足等问题,提出基于数字孪生的混流装配线资源配置优化方法.构建了物理装配车间、虚拟装配车间和生产计划系统协同工作的资源配置优化数字孪生模型,阐述了基于分段式解耦和多目标优化相结合的资源配置优化实现过程.将该方法应用于某企业混流装配线,结果表明优化后的装配线平衡率由...     

A hybrid genetic algorithm approach to mixed-model assembly line balancing

Assembly line balancing has been a focus of interest to academics in operation management for the last four decades. Mass production has saved huge costs for manufacturers in various industries for some time. With the growing trend of greater product variability and shorter life cycles, traditional mass production is being replaced in assembly lines. The current market is intensely competitive and consumer-centric. Mixed-model assembly lines are increasing in many industrial environments. This study deals with mixed-model assembly line balancing for n models, and uses a classical genetic algorithm approach to minimize the number of workstations. We also incorporated a hybrid genetic algorithm approach that used the solution from the modified ranked positional method for the initial solution to reduce the search space within the global space, thereby reducing search time. Several examples illustrate the approach. The software used for programming is C++ language .     

Real options approach for a mixed-model assembly line sequencing problem

Mixed-model assembly lines are widely used in manufacturing. This can be attributed to increased product variety and potential just-in-time (JIT) benefits obtained by applying mixed-model assembly lines. Because of market demand volatility, the flexibility of such a line is increasingly becoming more important and, consequently, determining an accurate sequence is becoming more complex. In this paper, first, we use the real options approach to evaluate one specific type of flexibility, i.e., product-mix flexibility. This methodology is applied to determine the products’ quantity that must be satisfied by the mixed-model assembly line. Then, in order to determine a desired sequence, we consider three objectives simultaneously: (1) total utility work cost, (2) total production rate variation cost, and (3) total set-up cost. A nonlinear zero–one model is developed for the problem whose objective function is a weighted sum of the above-mentioned objectives. Moreover, two efficient metaheuristics, i.e., a genetic algorithm (GA) and a memetic algorithm (MA), are proposed. These solution methods are compared with the optimal solution method using Lingo 6 software over a set of randomly generated test problems. The computational results reveal that the proposed memetic algorithm performs better than the proposed genetic algorithm.     

基于人因的混流装配系统复杂性优化

针对混流装配系统复杂性优化问题,以操作者在装配活动中的选择复杂性为研究对象,分析工作站装配复杂性引起的人员疲劳、响应时间等扰动因素对工作站可靠性的影响,以最小化装配系统复杂性为目标,建立基于人因的装配系统复杂性优化模型.采用遗传算法对模型进行求解,并用MATLAB编程进行实例验证.结果表明,该模型产生的产品分流调度方案能更好地平衡工作站之间的复杂度,有更大的生产实用价值.     

Solving a multi-objective mixed-model assembly line sequencing problem by a fuzzy goal programming approach

This paper presents a fuzzy goal programming approach to solve a multi-objective mixed-model assembly line sequencing problem in a just-in-time production system. A mixed-model assembly line is a type of production line capable of diversified small-lot production and is able to promptly respond to sudden demand changes for a variety of models. Determining the sequence of introducing models to such an assembly line is of particular importance for the efficient implementation of just-in-time (JIT) systems. In this paper, we consider three objectives, simultaneously: minimizing total utility work, total production rate variation, and total setup cost. Because of conflicting objectives, we propose a fuzzy goal programming-based approach to solve the model. This approach is constructed based on the desirability of decision maker (DM) and tolerances considered on goal values. To illustrate the behavior of the proposed model, some of instances are solved optimally and computational results reported.     

模拟退火算法在混流装配投产中的应用

对混流装配投产顺序的不同调度目标进行分析,建立混流装配投产的目标函数,着重讨论了模拟退火算法的原理及在混流装配投产中的应用流程,最后通过实例对算法进行验证.验证结果表明,模拟退火算法比常规的目标追迹法更有效,可以在生产中推广应用.