Abstract
The dynamic programming method which minimizes the number of stations for a given cycle time is extended here to solve two variants of the assembly-line balancing problem. The extended method minimizes cycle time for a given number of stations or, more generally, computes all nondominated pairs of cycle time and number of stations. The method is also applied to the stochastic case where minimizing critical cycle time, the number of stations and maximizing confidence level is desired.
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.
