Abstract
The paper presents integer programming formulations and a heuristic solution procedure for a bicriterion loading and assembly plan selection problem in a flexible assembly line. The problem objective is to simultaneously determine an allocation of assembly tasks among the stations and select assembly sequences and assembly routes for a mix of products so as to balance station workloads and to minimize total transportation time in a unidirectional flow system. In the approach proposed, first the station workloads are balanced using a linear relaxation-based heuristic and then assembly sequences and assembly routes are selected for all products, based on a network flow model. An illustrative example is provided and some computational results are reported.
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.
