Simple assembly line balancing problem of Type 1 with grey demand and grey task durations

2019 ◽  
Vol 9 (4) ◽  
pp. 401-414 ◽  
Author(s):  
Oğuzhan Ahmet Arık ◽  
Erkan Köse ◽  
Jeffrey Forrest
Keyword(s):  
Mathematical Model ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Grey Theory ◽  
Content Type ◽  
Task Durations ◽  
Simple Assembly ◽  
And Task

Purpose The purpose of this paper is to present a mixed integer programming model for simple assembly line balancing problems (SALBP) with Type 1 when the annual demand and task durations are uncertain and encoded with grey numbers. Design/methodology/approach Grey theory and grey numbers are used for illustrating the uncertainty of parameters in an SALBP, where the objective is to minimize the total number of workstations. The paper proposes a 0-1 mathematical model for SALBP of Type 1 with grey demand and grey task durations. Findings The uncertainty of the demand and task durations are encoded with grey numbers and a well-known 0-1 mathematical model for SALBP of Type 1 is modified to find the minimum number of workstations in order to meet both the lower and upper bounds of the uncertain demand. The results obtained from the proposed mathematical model show a task-workstation assignment that does not distribute precedence relations among tasks and workstations and the sum of task durations in each single workstation is less than or equal to the grey cycle time. Originality/value The grey theory and grey numbers have not been previously used to identify uncertainties in assembly line balancing problems. Therefore, this study provides an important contribution to the literature.

An immune genetic algorithm for simple assembly line balancing problem of type 1

2019 ◽  
Vol 39 (1) ◽  
pp. 113-123 ◽  
Author(s):  
Han-ye Zhang
Keyword(s):  
Genetic Algorithm ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Immune Genetic Algorithm ◽  
Content Type ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly ◽  
First Time

Purpose The purpose of this study is to develop an immune genetic algorithm (IGA) to solve the simple assembly line balancing problem of type 1 (SALBP-1). The objective is to minimize the number of workstations and workstation load for a given cycle time of the assembly line. Design/methodology/approach This paper develops a new solution method for SALBP-1, and a user-defined function named ψ(·) is proposed to convert all the individuals to satisfy the precedence relationships during the operation of IGA. Findings Computational experiments suggest that the proposed method is efficient. Originality/value An IGA is proposed to solve the SALBP-1 for the first time.

Multi-manned assembly line balancing problem with balanced load density

2015 ◽  
Vol 35 (1) ◽  
pp. 137-142 ◽  
Author(s):  
Hamid Yilmaz ◽  
Mustafa Yilmaz
Keyword(s):  
Mathematical Model ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Assembly Lines ◽  
Content Type ◽  
Task Load ◽  
Balance Task ◽  
Assembly Line Balancing Problem ◽  
First Time

Purpose – The purpose of this paper is balancing multi-manned assembly lines with load-balancing constraints in addition to conventional ones Most research works about the multi-manned assembly line balancing problems are focused on the conventional industrial measures that minimize total number of workers, number of multi-manned workstations or both. Design/methodology/approach – This paper provides a remedial constraint for the model to balance task load density for each worker in workstations. Findings – Comparisons between the proposed mathematical model and the existing multi-manned mathematical model show a quite promising better task load density performance for the proposed approach. Originality/value – In this paper, a mathematical model that combines the minimization of multi-manned stations, worker numbers and difference of task load density of workers is proposed for the first time.

An integer-coded differential evolution algorithm for simple assembly line balancing problem of type 2

2016 ◽  
Vol 36 (3) ◽  
pp. 246-261 ◽  
Author(s):  
Haijun Zhang ◽  
Qiong Yan ◽  
Yuanpeng Liu ◽  
Zhiqiang Jiang
Keyword(s):  
Differential Evolution ◽  
Assembly Line ◽  
Differential Evolution Algorithm ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Content Type ◽  
Evolution Algorithm ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly

Purpose This paper aims to develop a new differential evolution algorithm (DEA) for solving the simple assembly line balancing problem of type 2 (SALBP-2). Design/methodology/approach Novel approaches of mutation operator and crossover operator are presented. A self-adaptive double mutation scheme is implemented and an elitist strategy is used in the selection operator. Findings Test and comparison results show that the proposed IDEA obtains better results for SALBP-2. Originality/value The presented DEA is called the integer-coded differential evolution algorithm (IDEA), which can directly deal with integer variables of SALBP-2 on a discrete space without any posterior conversion. The proposed IDEA will be an alternative in evolutionary algorithms, especially for various integer/discrete-valued optimization problems.

An Improved Ant Colony Optimization for Large-Scale Simple Assembly Line Balancing Problem of Type-1

2012 ◽  
Vol 159 ◽  
pp. 51-55 ◽  
Author(s):  
Qiao Xian Zheng ◽  
Yuan Xiang Li ◽  
Ming Li ◽  
Qiu Hua Tang
Keyword(s):  
Ant Colony Optimization ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Ant Colony ◽  
Line Balancing ◽  
Test Problems ◽  
Selection Mechanism ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly

An improvement ant colony optimization(ACO) is proposed to solve the simple assembly line balancing problem of type-1 (SALBP-1) which aims to minimize the number of workstations for a given cycle time of assembly line. In the algorithm, three heuristic factors and two pheromones: (1) the pheromone between task and station, (2) the pheromone among tasks, are introduced to design the selection mechanism which is used to select task for station. The task assignment mechanism is proposed to assign suitable tasks to station. Ants select task based on selection mechanism, and then assign suitable one to station according to assignment mechanism. The result of literature test problems indicates the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document