Abstract
The goal chasing method is a popular algorithm in JIT system for the mixed model assembly line balancing problem. It is simple and easy to implement, but it is a very greedy algorithm and uses up ‘good’ parts in the early sequence so that the whole performance of the solution is influenced. In this paper, we provide the definition of good parts and good remaining sequence and analyze their relationship with the optimal solution's objective function value. We develop a new heuristic algorithm called ‘variance algorithm’ the numerical experiments show that the new algorithm can yield better solution with little more computation overhead.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.