A hybrid PSO/SA algorithm for bi-criteria stochastic line balancing with flexible task times and zoning constraints

This paper addresses a stochastic assembly line balancing problem with flexible task times and zoning constraints. in this problem, task times are regarded as interval variables with given lower and upper bounds. machines can compress processing times of tasks to improve the line efficiency, but it increase the equipment cost, which is defined via a negative linear function of task times. thus, it is necessary to make a compromise between the line efficiency and the equipment cost. to solve this problem, a bi-objective chance-constrained mixed 0–1 programming model is developed to simultaneously minimize the cycle time and the equipment cost. then, a hybrid particle swarm optimization algorithm is proposed to search a set of pareto-optimal solutions, which employs the simulated annealing as a local search strategy. the taguchi method is used to investigate the influence of parameters, and accordingly a suitable parameter setting is suggested. finally, the comparative results show that the proposed algorithm outperforms the existing algorithms by obtaining better solutions within the same running time.