Abstract

Sequencing mixed-model assembly lines is a well researched topic in the literature. However, many methods that have been developed to solve this problem fail to cope with either the large size or the specific characteristics of real-life problems. In this paper, a heuristic is proposed that is derived from Vogel's approximation method for transportation planning. The heuristic is able to handle large and supposedly difficult problem instances. Sophisticated test scenarios considering real-life aspects were generated to evaluate the performance of the heuristic for realistic problem instances. It is shown that the proposed heuristic significantly outperforms priority rule-based methods and requires only reasonable computational effort.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call