Abstract
One goal of designing a generalized flow line is to minimize the backtracking of jobs, i.e., to assign M machines to M locations along a linear track to minimize the total backtracking movements of jobs. It can be formulated as a quadratic assignment problem which is a difficult task to solve. In this paper, a genetic algorithm method is proposed and compared with some other methods. It is shown that the genetic algorithm method can find good quality solution effectively.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
