Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm
β Scribed by M. Bagher; M. Zandieh; H. Farsijani
- Book ID
- 105854021
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 465 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π 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,
## a b s t r a c t The objective of simple assembly line balancing problem type-1 (SALBP-1) is to minimize the number of workstations on an assembly line for a given cycle time. Since SALBP-1 is NP-hard, many iterative backtracking heuristics based on branch and bound procedure, tabu search, and g