A line balancing heuristic case study for existing automated surface mount assembly line setups
ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Assembly Line Reconfiguration Under Disturbances: An Evolutionary Approach to Decision Making
CIC '06 Proceedings of the 15th International Conference on Computing
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Network Models and Optimization: Multiobjective Genetic Algorithm Approach
Network Models and Optimization: Multiobjective Genetic Algorithm Approach
An efficient approach for type II robotic assembly line balancing problems
Computers and Industrial Engineering
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Multi-objective optimization of stochastic disassembly line balancing with station paralleling
Computers and Industrial Engineering
Hi-index | 0.00 |
When demand structure or production technology changes, a mixed-model assembly line (MAL) may have to be reconfigured to improve its efficiency in the new production environment. In this paper, we address the rebalancing problem for a MAL with seasonal demands. The rebalancing problem concerns how to reassign assembly tasks and operators to candidate stations under the constraint of a given cycle time. The objectives are to minimize the number of stations, workload variation at each station for different models, and rebalancing cost. A multi-objective genetic algorithm (moGA) is proposed to solve this problem. The genetic algorithm (GA) uses a partial representation technique, where only a part of the decision information about a candidate solution is expressed in the chromosome and the rest is computed optimally. A non-dominated ranking method is used to evaluate the fitness of each chromosome. A local search procedure is developed to enhance the search ability of moGA. The performance of moGA is tested on 23 reprehensive problems and the obtained results are compared with those by other authors.