Article ID: | iaor20063256 |
Country: | Netherlands |
Volume: | 168 |
Issue: | 3 |
Start Page Number: | 771 |
End Page Number: | 782 |
Publication Date: | Feb 2006 |
Journal: | European Journal of Operational Research |
Authors: | Urban Timothy L., Chiang Wen-Chyuan |
Keywords: | programming: integer |
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.