An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations

Due to its good versatility and independence, intelligent optimization algorithm has largely shortened the time of decision-making in large-scale optimization problems of manufacture. However, lower searching time often conflicts with the searching accuracy in most cases. To improve the problem solving capability, research in intelligent optimization algorithm based on different domain characteristics never stopped. From the view of manufacturing, this chapter classified and comprehensively analyzed all kinds of manufacturing optimization problems and their general methods, illustrated the application features and challenges of intelligent optimization algorithm in manufacturing, and summarized the development needs and trends of intelligent optimization algorithm in the field of manufacturing system.

show abstract

“…For the handling of multi-constraints in manufacturing problems, refer to recent literature [10,34,57,58,59,60,61,62,63,64].…”

Section: Handling Of Multi-constraintsmentioning

confidence: 99%

Recent Advances of Intelligent Optimization Algorithm in Manufacturing

Tao

Laili

Zhang

2014

Springer Series in Advanced Manufacturing

View full text Add to dashboard Cite

show abstract

“…As a result of this complexity status, both VWSolver and JUMPER are able to solve up to middle-size problem instances optimally (Kellegöz and Toklu 2012). Therefore, for practical purposes, it may be more appropriate to look for heuristic algorithms that generate acceptable solutions at a relatively minor computational expense.…”

Section: Introductionmentioning

confidence: 98%

“…When considering the structure of these types of products, while the prepared engine is being assembled to vehicle's body in one station, not allowing the assembly of other suitable prepared parts such as seat, steering wheel and headlight would be an inefficient approach from the economical point of the line and duration of the product flow in the line. Since the flow time of the product in simple assembly lines cannot be smaller than the total task time, response to demand variations in the market may be longer (Kellegöz and Toklu 2012). In fact, most of factories assembling these types of products use the line configuration with parallel multi-manned workstations which is one of the most economical solutions for their situations.…”

Section: Introductionmentioning

confidence: 99%

“…The balancing problems of these kinds of lines are known as assembly line balancing problem with parallel multi-manned workstations (PM-ALBP). These lines have various advantages over traditional assembly lines as follows: shorter line length, reduced throughput time, lower work-in-process (workpiece), decreased cost of tools and less material handling (Kellegöz and Toklu 2012). This type of assembly line is widely used in practice, typically in the production of large-size products such as in the automotive industry, but almost unmentioned in the academic literature (Dimitriadis 2006).…”

Section: Introductionmentioning

confidence: 99%

“…In paper by Kellegöz and Toklu (2012), PM-ALBP with minimising number of workers in the line is addressed, and a branch and bound algorithm named as JUMPER is proposed for solving this problem. JUMPER is composed of a branching scheme, some efficient dominance and feasibility criteria based on a problem-specific knowledge.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Kellegöz

Toklu

2014

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

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 smallsize 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.

show abstract

Multiobjective optimization allocation of multi‐skilled workers considering the skill heterogeneity and time‐varying effects in unit brake production lines

Zeng,

Nie

2023

Engineering Reports

View full text Add to dashboard Cite

The optimal allocation of multi‐skilled workers in labor‐intensive industries can improve production capacity and reduce production costs. In actual production, the efficiency of workers will change with time due to their proficiency, fatigue, and other effects. In this article, we attempt to solve the problem of multi‐skilled workers allocation in unit brake production lines considering the heterogeneity of skills and time‐varying effects. A nonlinear mixed‐integer programming model is established, which fully considers the impact of worker efficiency due to proficiency, fatigue, and multi‐task rest recovery. The product production cycle and worker cost are the two objectives of the optimization solution. An enhanced NSGA‐II algorithm that combines the improved NSGA‐II algorithm and the variable neighborhood search (VNS) algorithm is used to solve the multiobjective optimization problem. Finally, the weighted ideal point method is used to obtain the Pareto optimal solution. The application case of a unit brake production is considered to evaluate the proposed model. The results indicate that the time cost and salary cost of workers are reduced by 8.03% and 18.91% compared with the original scheduling. The scheduling model considering learning, fatigue and recovery factors is more suitable for the actual production situation, ensuring the completion time and reducing the labor cost.

show abstract

An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations

Cited by 58 publications

References 54 publications

Recent Advances of Intelligent Optimization Algorithm in Manufacturing

Recent Advances of Intelligent Optimization Algorithm in Manufacturing

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

Multiobjective optimization allocation of multi‐skilled workers considering the skill heterogeneity and time‐varying effects in unit brake production lines

Contact Info

Product

Resources

About