Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483359 | European Journal of Operational Research | 2006 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Timothy L. Urban, Wen-Chyuan Chiang,