A scatter search based hyper-heuristic for sequencing a mixed-model assembly line, Journal of Heuristics

Abstract

We address a mixed-model assembly-line sequencing problem with work overload minimization criteria.We consider time windows in work stations of the assembly line (closed stations) and different versions of a product to be assembled in the line, which require different processing time according to the work required in each work station. In a paced assembly line, products are feeded in the line at a predetermined constant rate (cycle time). Then, if many products with processing time greater than cycle time are feeded consecutively, work overload can be produced when the worker has insufficient time to finish his/her job. We propose a scatter search based hyper-heuristic for this NP-hard problem. In the low-level, the procedure makes use of priority rules through a constructive procedure. Computational experiments over a wide range of instances from the literature show the effectiveness of the proposed hyper-heuristics when compared to existing heuristics. The relevance of the priority rules was evaluated as well.