Abstract
This paper introduces a beam search approach to sequencing mixed-model assembly lines and compares that approach to existing sequencing heuristics. The comparison study consists of over 400 test problems that vary in terms of number of product models, quantity of assembly, and degree of component commonality. The results show that beam search techniques are clearly superior to both the goal chasing algorithm (GCA) and Miltenburg and Sinnamon's look ahead heuristic. The second half of this paper extends the beam search approach to allow two scheduling objectives: (1) minimizing parts consumption variation, and (2) minimizing workload variation. Termed filtered beam, this variation uses a filter to eliminate alternatives that exceed a predetermined threshold according to one objective, and then proceeds with the beam search for the second objective. As in the first case, optimization is not guaranteed; however, the filtered beam search provides a frontier of good trade-off solutions from which the decision maker can choose an acceptable sequence.
Sign-in/Register to access full text options 
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.
