Search results

Various approaches and algorithms have been proposed since the 1950s to solve the assembly line (AL) balancing problem. These methods have established an AL configuration from the beginning. However, a prebalanced AL may have to be rebalanced in real life for many reasons, such as changes in the cycle time, production demand, product features or task operation times. This problem has increasingly attracted the interest of scientists in recent years. This study aims to offer a detailed review of the assembly line rebalancing problems (ALRBPs) to provide a better insight into the theoretical and practical applications of ALRBPs.

A structured database search was conducted, and 41 ALRBP papers published between 2005 and 2022 were classified based on the problem structure, objective functions, problem constraints, reasons for rebalancing, solution approaches and type of data used for solution evaluation. Finally, future research directions were identified and recommended.

Single model, straight lines with deterministic task times were the most studied type of the ALRBPs. Eighteen percent of the studies solved worker assignment problems together with ALRBP. Product demand and cycle time changes were the leading causes of the rebalancing need. Furthermore, seven future research opportunities were suggested.

Although there are many review studies on AL balancing problems, to the best of the authors’ knowledge, there have been no attempts to review the studies on ALRBPs.

The purpose of this study is to develop a new mathematical model and an exact solution method for an assembly line rebalancing problem. When an existing assembly line has to be adapted to a new production context, the line balancing, resources allocation and component management solutions have to be revised. The objective is to minimize the number of modifications to be done in the initial line in order to reduce the time and investment needed to meet new production requirements. The proposed model is evaluated via a computational experiment. The obtained results the efficacy of the proposed method.

This paper develops a new mathematical model and an exact solution method for an assembly line rebalancing problem with the objective to minimize the number of modifications to be done in the initial line to reduce the time and investments needed to meet new production requirements.

The computational experiments show the efficacy of the proposed method.

These reconfiguration costs were analysed for different part-feeding policies that can be adopted in an assembly line.

Reducing production auxiliary time is the key to improve the efficiency of the existing mixed-flow assembly line. This paper proposes a method combining improved genetic algorithm (GA) and Flexsim software. It also investigates mixed-flow assembly line scheduling and just-in-time (JIT) parts feeding scheme to reduce waste in production while taking the existing hill-drop mixed-flow assembly line as an example to verify the effectiveness of the method.

In this research, a method is presented to optimize the efficiency of the present assembly line. The multi-objective mathematical model is established based on the objective function of the minimum production cycle and part consumption balance, and the solution model is developed using multi-objective GA to obtain the mixed flow scheduling scheme of the hill-drop planter. Furthermore, modeling and simulation with Flexsim software are investigated along with the contents of line inventory, parts transportation means, daily feeding times and time points.

Theoretical analysis and simulation experiments are carried out in this paper while taking an example of a hill-drop planter mixed-flow assembly line. The results indicate that the method can effectively reduce the idle and overload of the assembly line, use the transportation resources rationally and decrease the accumulation of the line inventory.

The method of combining improved GA and Flexsim software was used here for the first time intuitively and efficiently to study the balance of existing production lines and JIT feeding of parts. Investigating the production scheduling scheme provides a reference for the enterprise production line accompanied by the quantity allocation of transportation tools, the inventory consumption of the spare parts along the line and the utilization rate of each station to reduce the auxiliary time and apply practically.

The product family assembly line (PFAL) is a mixed model-assembly line, which is widely used in mass customization and intelligent manufacturing. The purpose of this paper is to study the problem of PFAL, a flexible (evolution) planning method to respond to product evolution for PFAL, to focus on product data analysis and evolution planning method.

The evolution balancing model for PFAL is established and an improved NSGA_II (INSGA_II) is proposed. From the perspective of data analysis, dynamic characteristics of PFAL are researched and analyzed. Especially the tasks, which stability is considered, can be divided into a platform and individual task. In INSGA_II algorithm, a new density selection and a decoding method based on sorting algorithms are proposed to compensate for the lack of traditional algorithms.

The effectiveness and feasibility of the method are validated by an example of PFAL evolution planning for a family of similar mechanical products. The optimized efficiency is significantly improved using INSGA_II proposed in this paper and the evolution planning model proposed has a stronger ability to respond to product evolution, which maximizes business performance over an effective period of time.

The assembly line designers and managers in discrete manufacturing companies can obtain an optimal solution for PFAL planning through the evolution planning model and INSGA-II proposed in this paper. Then, this planning model and optimization method have been successfully applied in the production of small wheel loaders.

Changing the product characteristics and demand quantity resulting from the variability of the modern market leads to re-assigned tasks and changing the cycle time on the production line. Therefore, companies need re-balancing of their assembly line instead of balancing. The purpose of this paper is to propose an efficient algorithm approach for U-type assembly line re-balancing problem using stochastic task times.

In this paper, a genetic algorithm is proposed to solve approach for U-type assembly line re-balancing problem using stochastic task times.

The performance of the genetic algorithm is tested on a wide variety of data sets from literature. The task times are assumed normal distribution. The objective is to minimize total re-balancing cost, which consists of workstation cost, operating cost and task transposition cost. The test results show that proposed genetic algorithm approach for U-type assembly line re-balancing problem performs well in terms of minimizing total re-balancing cost.

Demand variation is considered for stochastic U-type re balancing problem. Demand change also affects cycle time of the line. Hence, the stochastic U-type re-balancing problem under four different cycle times are analyzed to present practical case.

As per the authors’ knowledge, it is the first time that genetic algorithm is applied to stochastic U-type re balancing problem. The large size data set is generated to analyze performance of genetic algorithm. The results of proposed algorithm are compared with ant colony optimization algorithm.

Main constraints for an assembly line balancing problem (ALBP) are cycle time/number of stations and task precedence relations. However, due to the technological and organizational limitations, several other restrictions can be encountered in real production systems. These restrictions are called as assignment restrictions and can be task assignment, station, resource and distance limitations. The purpose of the study is to evaluate the effects of these restrictions on ALBP using constraint programming (CP) model.

A novel CP model is proposed and compared to mixed-integer programming (MIP) as a benchmark. The objective is to minimize the cycle time for a given number of stations. The authors also provide explicit anthology of the assignment restriction effects on line efficiency, the solution quality and the computation time.

The proposed approach is verified with the literature test instances and a real-life problem from a furniture manufacturing company. Computational experiments show that, despite the fact that additional assignment restrictions are problematic in mathematical solutions, CP is a versatile exact solution alternative in modelling and the solution quality.

Assembly line is a popular manufacturing system in the making of standardized high volume products. The problem of assembly line balancing is a crucial challenge in these settings and consists of assigning tasks to the stations by optimizing one or more objectives. Type-2 AR-ALBP is a specific case with the objective function of minimizing the cycle time for a given number of stations. It further assumes assignment restrictions that can be confronted due to the technological limitations or the strategic decisions of the company management. This is especially encountered in rebalancing lines.

Several solution approaches such as mathematical modelling, heuristic and meta-heuristic are proposed to solve the ALBP in the literature. In this study, a new approach has been presented using CP. Efficient models are developed for Type-2 ALBP with several assignment restrictions. Previous studies have not considered the problem to the presented extent. Furthermore, to the best of the authors’ knowledge, the paper is the first study that solves ALBP with assignment restrictions using CP.

There are both “Swedish” and “Japanese” models for the organization of final assembly. Discusses the theoretical and historical background to these models and the main practical differences between them. Provides an empirical study based on action research conducted in the final assembly area of a Scottish electronics company. The aims of the research were to effect change in the company by applying just‐in‐time (JIT) assembly methods, and to observe the process of change and the consequences for production of the cellular approach to assembly and the formation of assembly teams. Two projects were undertaken. In the first, a JIT cell was built for the assembly of a new product; this cell and an existing, conventional flowline operated in parallel for a period. In the second, a work team was formed, consisting of the operators assembling an older product on a machine‐paced line; the members of this team were given a significantly higher level of work autonomy than before. Provides a detailed account of the two projects.

Cycle time fluctuations in assembly lines are one of the important reasons of re‐balancing. As a result of re‐balancing of assembly lines, it will be necessary to change task sequences or equipment locations. The purpose of this paper is to find the task sequence which enables assembly line balancing (ALB) with minimum number of stations (NS) for different cycle times such that tasks and equipment or fixture locations remain unchanged.

In this paper a heuristic which consist of two stages is proposed to find a common task sequence for different cycle times in assembly lines.

It is shown that optimal NS for different cycle times can be achieved with a fixed task sequence.

The approach is limited to a single model case. Model variety together with cycle time variety can be investigated in further studies.

Assembly lines which require less time and cost for re‐balancing can be easily designed by the proposed approach.

ALB problem is handled with a new viewpoint. Also, it is observed that the proposed approach serves as a bridge between assembly line design and balancing. In this regard, it is thought to have an important place in the ALB literature.

The increasing energy shortage leads to worldwide attentions. This paper aims to develop a mathematical model and optimization algorithm to solve the energy-oriented U-shaped assembly line balancing problem. Different from most existing works, the energy consumption is set as a major objective.

An improved flower pollination algorithm (IFPA) is designed to solve the problem. The random key encoding mechanism is used to map the continuous algorithm into discrete problem. The pollination rules are modified to enhance the information exchange between individuals. Variable neighborhood search (VNS) is used to improve the algorithm performance.

The experimental results show that the two objectives are in conflict with each other. The proposed methodology can help manager obtain the counterbalance between them, for the larger size balancing problems, and the reduction in objectives is even more significant. Besides, the experiment results also show the high efficiency of the proposed IFPA and VNS.

The main contributions of this work are twofold. First, a mathematical model for the U-shaped assembly line balancing problem is developed and the model is dual foci including minimized SI and energy consumption. Second, an IFPA is proposed to solve the problem.

FEW workers display greater concentration than the man creating delightful glass objects on a seaside pier during the summer months. He is so intent on his work that he has small interest in the fascinated onlookers. Here is living proof that to the average worker nothing is more important than the nature and content of his job.