Abstract
Abstract In this study we will present an improved version of the Bowman-White zero-one integer programming formulation of an assembly line balancing problem. We will demonstrate that in solving the above problem, certain steps in Geoffrion's 0–1 integer programming algorithm can be simplified or eliminated. Computational results are given which indicate that the proposed algorithm is faster than the present exact methods.
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.
