A competitive branch-and-bound algorithm for the simple assembly line balancing problem

1999 ◽  
Vol 37 (8) ◽  
pp. 1787-1816 ◽  
Author(s):  
A. Sprecher
Keyword(s):  
Branch And Bound ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Branch And Bound Algorithm ◽  
Line Balancing ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly

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.

Sign in / Sign up

Export Citation Format

Share Document