A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Genetic algorithms for assembly line balancing with various objectives
Computers and Industrial Engineering - Special issue: IE in Korea
Binary integer formulation for mixed-model assembly line balancing problem
Computers and Industrial Engineering
Two-sided assembly line balancing to maximize work relatedness and slackness
Computers and Industrial Engineering
A new heuristic method for mixed model assembly line balancing problem
Computers and Industrial Engineering
Mixed model assembly line design in a make-to-order environment
Computers and Industrial Engineering
A mathematical model and a genetic algorithm for two-sided assembly line balancing
Computers and Operations Research
2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines
Computers and Industrial Engineering
A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II
Computers and Industrial Engineering
Hi-index | 0.00 |
This research deals with balancing a mixed-model U-line in a Just-In-Time (JIT) production system. The research intends to reduce the number of stations via balancing the workload and maximizing the weighted efficiency, which both are considered as the objectives of this research paper. After balancing the line and determining the number of stations, the labor assignment policy should be set. In this study, it was assumed that there are two types of operators: permanent and temporary. Both types can work in regular and overtime periods. Based on their skill levels, workers are classified into four types. The sign at each work station indicates types of workers allowed to work at that station. An alert system using the hybrid kanban systems was also considered. To solve this problem, a Simulated Annealing algorithm was applied in the following three stages. First, the balancing problem was solved and the number of stations was determined. Second, workers were assigned to the workstations in which they are qualified to work. Following that, an alert system based on the kanban system was designed to balance the work in the process inventory. This was achieved by defining control points based on the processing time and making control decisions to minimize the number of kanban cards. In the proposed SA algorithm, two methods for the temperature cooling schedule were considered and two methods were defined for determining the number of neighborhood search. The initial temperature was considered equal to the cost of the initial solution to reach the convergence situation as soon as possible. Five problems were solved in small size using the GAMS software. The results obtained from the GAMS software were compared with those obtained from the SA algorithm to determine the performance difference. The computational results demonstrated that the SA algorithm is more consistent with the answers obtained. Also seven large scale problems were solved. The results showed that the SA algorithm still have better reliability. To show the efficiency of the proposed SA algorithm, an axel assembly company was studied. To satisfy demands and reduce backlogging, a mixed model assembly line was designed for this case study. The results showed that the mixed model assembly line designed using the SA algorithm had good efficiency.