An Optimization Model for Assembly Line Balancing Problem with Uncertain Cycle Time

Cao, Yingbin; Yuan, Li; Liu, Qinghua; Zhang, Jie

doi:10.1155/2020/2785278

Cited by 6 publications

(4 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cycle time minimization objective of the SALBP-2 is a common objective within multi-objective versions of the SALBP [23] and the GALBP [21,24,25], assembly line balancing problems with heterogeneous workstations [19,[26][27][28][29].…”

Section: Review On the Resolution Methodsmentioning

confidence: 99%

A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations

et al. 2021

View full text Add to dashboard Cite

The assembly line balancing problem is a classical optimisation problem whose objective is to assign each production task to one of the stations on the assembly line so that the total efficiency of the line is maximized. This study proposes a novel hybrid method to solve the simple version of the problem in which the number of stations is fixed, a problem known as SALBP-2. The hybrid differs from previous approaches by encoding individuals of a genetic algorithm as instances of a modified problem that contains only a subset of the solutions to the original formulation. These individuals are decoded to feasible solutions of the original problem during fitness evaluation in which the resolution of the modified problem is conducted using a dynamic programming based approach that uses new bounds to reduce its state space. Computational experiments show the efficiency of the method as it is able to obtain several new best-known solutions for some of the benchmark instances used in the literature for comparison purposes.

show abstract

Section: Review On the Resolution Methodsmentioning

confidence: 99%

A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Type II simple assembly line balancing problem already been suggested in the relevant studies [11]. The basic SALBP-I (type-I) and SALBP-II (type-II) problems have been extensively studied in the literature the key goal of balancing an assembly line is to maximize the effectiveness of the line whichever by SALBP-I or by SALBP-II [12]. In assembly line balancing manufacturers are concerned about the effect of uncertainties on assembly line [13].…”

Section: Literature Reviewmentioning

confidence: 99%

“…A new debottlenecking approach is adopted based on principal component analysis (PCA) that can be utilized to recognize and remove sustainability bottlenecks during the planning stage. Researchers can use this context as a tool to quickly identify the signi cant bottlenecks impacting the e ciency of a speci ed process, structure, or design [12]. Hong-Sen yan et al, [11] proposes a net-like model for KMS shifting bottleneck identi cation that is particularly suited to extremely supple and intelligent manufacturing systems.…”

Section: Literature Reviewmentioning

confidence: 99%

Enhancing the Productivity and Assembly Line Balancing Through Takt Time Implementation

Khalil,

Din,

Ali

et al. 2024

Preprint

View full text Add to dashboard Cite

In Pakistan, automotive sector is setting leaps in term of expansion, and achieved a phenomenal growth of 171% between the years 2014 and 2018. Keeping in view, the high demand and production of the sector, it is crucial to generate fruitful revenue from it. For this purpose, the production lines efficiency and productivity should be significantly optimized. Nowadays majority of industries are shifting towards green manufacturing with the application of lean manufacturing tools such as implementation of Takt Time. The proposed study is carried out at Honda Pakistan to reduce the cycle time of KIRA machine through line balancing techniques (Largest Candidate Rule, Longest-Task-Time Heuristic and Mathematical Modelling), capacity calculation, and validated the results via Rockwell Arena simulation software. Moreover, cost benefit analysis is committed to check economic effect of proposed model. Further, after implementation of proposed model, the cycle time of KIRA is reduced from 68.8 sec to 59.08 sec (takt time), and production rate is enhanced from 2800 parts to 3263 parts per day. Lastly, bottleneck is resolved, ultimately leading to increase in line efficiency and station utilization, while on other hand balance delay and line smoothing index are decreased.

show abstract

“…However, metaheuristic algorithms bring about benefits in discovering high-quality solutions (Zhang et al ., 2023). Various metaheuristic algorithms are used including genetic algorithm (Anwar et al ., 2019; Cao et al ., 2020), particle swarm optimisation (Zhang et al ., 2021a), ant colony optimisation (Huo et al ., 2018a, b), simulated annealing (Lalaoui and El Afia, 2018) and so on. In a thorough literature review conducted by (Boysen et al ., 2021) on assembly line balancing, it is worth noting that the ABC algorithm has received comparatively less attention compared to other metaheuristic algorithms.…”

Section: Introductionmentioning

confidence: 99%

An artificial bee colony based-hyper heuristic algorithm with local search for the assembly line balancing problems

Deliktaş,

Aydin

2023

View full text Add to dashboard Cite

PurposeAssembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.Design/methodology/approachThis paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.FindingsThe experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.Originality/valueThis research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.

show abstract

An Optimization Model for Assembly Line Balancing Problem with Uncertain Cycle Time

Cited by 6 publications

References 40 publications

A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations

A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations

Enhancing the Productivity and Assembly Line Balancing Through Takt Time Implementation

An artificial bee colony based-hyper heuristic algorithm with local search for the assembly line balancing problems

Contact Info

Product

Resources

About