Abstract

This paper presents the development of a genetic algorithm for determining a common linear machine sequence for multi-products with different operation sequences and facilities with a limited number of duplicate machine types available for a job. This work aims to minimize the total flow distance traveled by products, reduce the number of machines arranged in the final linear sequence, and decrease the total investment cost of the machines used in the final sequence. We assume that product flow runs only in the forward direction, either via in-sequence or bypass movement. We demonstrate the effectiveness of the proposed algorithm by solving a typical layout design problem taken from literature, and several randomly generated problems. Results indicate that the proposed algorithm serves as a practical decision support tool for resolving layout problems in manufacturing facilities.

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