Abstract
The utilization of U-shaped layouts in place of the traditional straight-line configuration has become increasingly popular, with reported benefits of substantial improvements in productivity and quality. This paper examines the U-line balancing problem with stochastic task times. A chance-constrained, piecewise-linear, integer program is formulated to find the optimal solution. Various approaches used to identify a tight lower bound are also presented, as are operable extensions to the basic model. Computational results show that the proposed method is able to solve practical-sized problems.
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.
