An imperialist competitive algorithm in mixed-model assembly line sequencing problem to minimise unfinished works

摘要

Mixed-model assembly lines (MMALs) are a type of production lines where a variety of product models similar to product characteristics are assembled in a just-in-time production system. Usually, MMAL consists of a number of stations linked by a conveyor belt and each station has a work zone limited by upstream and downstream boundaries. To avoid improper interference between operators in the adjacent stations and excess of machine moving range, operators are forced to complete their operations within their predetermined work zone. There is a set of criteria on which to judge sequences of product models in terms of the effective utilisation of these lines. In this paper, the sequence of models for minimising the total unfinished work within their work zone is discussed. A novel imperialist competitive algorithm (ICA) is developed for solving this problem in small-, medium-and large-scale problems. The solutions obtained via ICA are compared against solutions obtained via B&B, a heuristic procedure, GRASP and BDP-2 in small problems, and also against a proposed genetic algorithm and a simulated annealing in small, medium and large problems. Experimental results show that this algorithm provides reasonably good solutions with low computational costs.