Search results

The purpose of this paper is to define new criteria for measuring workload smoothness of two-sided assembly lines and propose an algorithm to solve a two-sided assembly line balancing problem focusing on distributing the idle time and the workload as evenly as possible among the workstations.

This paper points out that the mean absolute deviation (MAD) and the smoothness index (SI) used to measure the workload smoothing in one-sided assembly lines are both inappropriate to evaluate the workload balance among workstations in two-sided assembly lines, as the idle time occur at the beginning and in the middle of a cycle within workstations. Then, the finish-time-based SI and MAD (FSI and FMAD) are defined, and a heuristic procedure based on the core mechanism of Moodie and Young method is proposed to smooth the assembly workload in two-sided assembly lines.

The computational results indicate that the proposed heuristic algorithm combined with the FMAD is effective in distributing the idle time and the workload among workstations as evenly as possible in two-sided assembly lines.

The two-sided assembly line balancing problem with the objective of the line efficiency can be effectively solved by the proposed approach.

The FMAD is proposed to effectively improve the workload smoothing in two-sided assembly lines.

This study aims to propose an efficient optimization algorithm to solve the assembly line balancing problem (ALBP). The ALBP arises in high-volume, lean production systems when decision-makers aim to design an efficient assembly line while satisfying a set of constraints.

An improved genetic algorithm (IGA) is proposed in this study to deal with ALBP to optimize the number of stations and the workload smoothness.

To evaluate the performance of the IGA, it is used to solve a set of well-known benchmark problems and a real-life problem faced by an automobile manufacturer. The solutions obtained are compared against two existing algorithms in the literature and the basic genetic algorithm. The comparisons show the high efficiency and effectiveness of the IGA in dealing with ALBPs.

The proposed IGA benefits from a novel generation transfer mechanism that improves the diversification capability of the algorithm by allowing population transfer between different generations. In addition, an effective variable neighborhood search is used in the IGA to enhance its local search capability.

The purpose of this study is to first investigate the efficiency of the most commonly used performance measures for minimizing the number of workstations (NWs) in approaches addressing simple assembly line balancing problem (SALBP) for both straight and U-shaped line, and second to provide a comparative evaluation of 20 constructive heuristics to find solutions to the SALBP-1.

A total of 200 problems are solved by 20 different constructive heuristics for both straight and U-shaped assembly line. Moreover, several comparisons have been made to evaluate the performance of constructive heuristics.

Minimizing the smoothness index is not necessarily equivalent to minimizing the NWs; therefore, it should not be used as the fitness function in approaches addressing the SALBP-1. Line efficiency and the idle time are indeed reliable performance measures for minimizing the NWs. The most promising heuristics for straight and U-shaped line configurations for SALBP-1 are also ranked and introduced.

Results are expected to help scholars and industrial practitioners to better design effective solution methods for having the most balanced assembly line. This study will further help with choosing the most proper heuristic with regard to the problem specifications and line configuration.

There is limited research assessing the efficiency of the common objectives for SALBP-1. This study is among the first to prove that minimizing the workload smoothness is not equivalent to minimizing the NWs in SALBP-1 studies. This work is also one of the first attempts for evaluating the constructive heuristics for both straight and U-shaped line configurations.

The purpose of this paper is to apply particle swarm optimization (PSO) a known combinatorial optimization algorithm to multi‐objective (MO) balancing of large assembly lines.

A novel approach based on PSO is developed to tackle the simple assembly line balancing problem (SALBP), a well‐known NP‐hard production and operations management problem. Line balancing is considered for two‐criteria problems utilizing cycle time and workload smoothing as performance criteria, as well as for three‐criteria problems involving the balance delay time of the line together with cycle time and workload smoothing. Emphasis is on seeking a set of diverse Pareto optimal solutions for the bi‐criteria SALBP.

Experiments carried out on multiple test problems taken from the open literature are reported and discussed. Comparisons between the proposed PSO algorithm and two existing MO population heuristics show a quite promising higher performance for the proposed approach.

Artificial particles (potential solutions “flown” by PSO though hyperspace) are encoded to actual ALB solutions via a novel representation mechanism. A new scheme for generating and maintaining diverse Pareto ALB solutions is proposed. For the case of the two‐criteria ALBPs, the individual objectives are summed to a weighted combination with the weight coefficients being dynamically adapted using a novel weighted aggregation method. This weighted method can be applied on any bi‐criteria optimization problem.

Rabbit chase (RC) is used as one of the most effective techniques in manufacturing systems, as such systems have high level of adaptability and increased productivity in addition to providing uniform workload balancing and skill improving environment. In assembly systems, RC inspires the development of walking worker assembly line (WWAL). On the other hand, U-type assembly lines (UALs) may provide higher worker utilization, lower space requirement and more convenient internal logistics when compared to straight assembly lines. In this context, this study aims to improve assembly line performance by generating RC cycles on WWAL with respect to task assignment characteristics of UAL within reasonable walking distance and space requirement. Therefore, a novel line configuration, namely, segmented rabbit chase-oriented U-type assembly line (SRCUAL), emerges.

The mathematical programming approach treats SRCUAL balancing problem in a hierarchical manner to decrease computational burden. Firstly, segments are generated via the first linear programming model in the solution approach for balancing SRCUALs to minimize total number of workers. Then, stations are determined within each segment for forward and backward sections separately using two different pre-emptive goal programming models. Moreover, three heuristics are developed to provide solution quality with computational efficiency.

The proposed mathematical programming approach is applied to the light-emitting diode (LED) luminaire assembly section of a manufacturing company. The adaptation of SRCUAL decreased the number of workers by 15.4% and the space requirement by 17.7% for LED luminaire assembly system when compared to UAL. Moreover, satisfactory results for the proposed heuristics were obtained in terms of deviation from lower bound, especially for SRCUAL heuristics I and II. Moreover, the results indicate that the integration of RC not only decreased the number of workers in 40.28% (29 instances) of test problems in U-lines, but also yielded less number of buffer points (48.48%) with lower workload deviation (75%) among workers in terms of coefficient of variation.

This study provides convenience for capacity management (assessing capacity and adjusting capacity by changing the number of workers) for industrial SRCUAL applications. Meanwhile, SRCUAL applications give the opportunity to increase the capacity for a product or transfer the saved capacity to the assembly of other products. As it is possible to provide one-piece flow with equal workloads via walking workers, SRCUAL has the potential for quick realization of defects and better lead time performance.

To the best of the authors’ knowledge, forward–backward task assignments in U-type lines have not been adapted to WWALs. Moreover, as workers travel overall the line in WWALs, walking time increases drastically. Addressing this research gap and limitation, the main innovative aspect of this study can be considered as the proposal of a new line design (i.e. SRCUAL) which is sourced from the hybridization of UALs and WWAL as well as the segmentation of the line with RC cycles. The superiority of SRCUAL over WWAL and UAL was also discussed. Moreover, operating systematic for SRCUAL was devised. As for methodical aspect, this study is the first attempt to solve the balancing problem for SRCUAL design.

This paper aims to review and discuss four aspects of mixed-model assembly line balancing (MMALB) problem mainly on the optimization angle. MMALB is a non-deterministic polynomial-time hard problem which requires an effective algorithm for solution. This problem has attracted a number of research fields: manufacturing, mathematics and computer science.

This paper review 59 published research works on MMALB from indexed journal. The review includes MMALB problem varieties, optimization algorithm, objective function and constraints in the problem.

Based on research trend, this topic is still growing with the highest publication number observed in 2016 and 2017. The review indicated that the future research direction should focus on human factors and sustainable issues in the problem modeling. As the assembly cost becomes crucial, resource utilization in the assembly line should also be considered. Apart from that, the growth of new optimization algorithms is predicted to influence the MMALB optimization, which currently relies on well-established algorithms.

The originality of this paper is on the research trend in MMALB. It provides the future direction for the researchers in this field.

The purpose of this paper is to introduce robust optimization approaches to balance mixed model assembly lines with uncertain task times and daily model mix changes.

Scenario planning approach is used to represent the input data uncertainty in the decision model. Two kinds of robust criteria are provided: one is min‐max related; and the other is α‐worst scenario based. Corresponding optimization models are formulated, respectively. A genetic algorithm‐based robust optimization framework is designed. Comprehensive computational experiments are done to study the effect of these robust approaches.

With min‐max related robust criteria, the solutions can provide an optimal worst‐case hedge against uncertainties without a significant sacrifice in the long‐run performance; α‐worst scenario‐based criteria can generate flexible robust solutions: through rationally tuning the value of α, the decision maker can obtain a balance between robustness and conservatism of an assembly line task elements assignment.

This paper is an attempt to robust mixed model assembly line balancing. Some more efficient and effective robust approaches – including robust criteria and optimization algorithms – may be designed in the future.

In an assembly line with significant uncertainty, the robust approaches proposed in this paper can hedge against the risk of poor system performance in bad scenarios.

Using robust optimization approaches to balance mixed model assembly line.

This study aims to propose a new multiobjective optimization metaheuristic based on the tiki-taka algorithm (TTA). The proposed multiobjective TTA (MOTTA) was implemented for a simple assembly line balancing type E (SALB-E), which aimed to minimize the cycle time and workstation number simultaneously.

TTA is a new metaheuristic inspired by the tiki-taka playing style in a football match. The TTA is previously designed for a single-objective optimization, but this study extends TTA into a multiobjective optimization. The MOTTA mimics the short passing and player movement in tiki-taka to control the game. The algorithm also utilizes unsuccessful ball pass and multiple key players to enhance the exploration. MOTTA was tested against popular CEC09 benchmark functions.

The computational experiments indicated that MOTTA had better results in 82% of the cases from the CEC09 benchmark functions. In addition, MOTTA successfully found 83.3% of the Pareto optimal solution in the SALB-E optimization and showed tremendous performance in the spread and distribution indicators, which were associated with the multiple key players in the algorithm.

MOTTA exploits the information from all players to move to a new position. The algorithm makes all solution candidates have contributions to the algorithm convergence.

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.

In this study, a mixed-model assembly line (MMAL) balancing problem is applied in a make-to-order (MTO) environment. One of the important problems in MTO systems is identifying the control points, which is considered by designing a control system. Furthermore, the worker assignment problem is defined by considering abilities and operating costs of workers. The proposed model is solved in two stages. First, a multi-objective model by simultaneously minimizing the number of stations and the total cost of the task duplication and workers assignment is considered. The second stage is designing a control system to minimize the work in process.

To solve this problem, a non-dominated sorting genetic algorithm (NSGA-II) is introduced and the proposed model is compared with four multi-objective algorithms (MOAs).

The proposed model is compared with four MOAs, i.e. multi-objective particle swarm optimization, multi-objective ant colony optimization, multi-objective firefly algorithm and multi-objective simulated annealing algorithm. The computational results of the NSGA-II algorithm are superior to the other algorithms, and multi-objective ant colony optimization has the best running time of the four MOA algorithms.

With attention to workers assignment in a MTO environment for the MMAL balancing problem, the present research has several significant implications for the rapidly changing manufacturing challenge.

To the best of the authors’ knowledge, no study has provided for the MMAL balancing problem in a MTO environment considering control points. This study provides the first attempt to fill this research gap. Also, a usual assumption in the literature that common tasks of different models must be assigned to a single station is relaxed and different types of real assignment restrictions like resource restrictions and tasks restrictions are described.