to change floors during the execution of the algorithm. However, if the run times are required to be reasonable and comparable, it is no longer clear that the single-stage approach will lead to superior solutions because it has to explore a larger solution space. The performance of the twostage appr
A single-run optimization algorithm for stochastic assembly line balancing problems
โ Scribed by JrJung Lyu
- Publisher
- Society of Manufacturing Engineers
- Year
- 1997
- Tongue
- English
- Weight
- 658 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0278-6125
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper presents a new algorithm for solving stochastic line balancing problems, The proposed algorithm is based on the single-run optimization approach, which is applied to find the optimal parameters of a simulation model, A comparison with other developed algorithms in the literature shows that the proposed algorithm is fast, accurate, and relatively robust in solving stochastic assembly line balancing problems, The experimental results indicate the proposed algorithm is worthy of further study.
๐ SIMILAR VOLUMES
This paper deals with multi-objective optimization of a single-model stochastic assembly line balancing problem with parallel stations. The objectives are as follows: (1) minimization of the smoothness index and (2) minimization of the design cost. To obtain Pareto-optimal solutions for the problem,