吞吐量
工作(物理)
阻塞(统计)
限制
计算机科学
直线(几何图形)
生产(经济)
运营管理
运筹学
计算机网络
电信
经济
数学
微观经济学
工程类
无线
机械工程
几何学
作者
Yun Fong Lim,Kum Khiong Yang
标识
DOI:10.1111/j.1937-5956.2009.01009.x
摘要
One way to coordinate workers along an assembly line that has fewer workers than work stations is to form a bucket brigade. The throughput of a bucket brigade on discrete work stations may be compromised due to blocking even if workers are sequenced from slowest to fastest. For a given work distribution on the stations we find policies that maximize the throughput of the line. When workers have very different production rates, fully cross‐training the workers and sequencing them from slowest to fastest is almost always the best policy. This policy outperforms other policies for most work distributions except for some cases in which limiting the work zones of workers produces higher throughput. In environments where the work can be adjusted across stations, we identify conditions for a line to prevent blocking.
科研通智能强力驱动
Strongly Powered by AbleSci AI