This paper is devoted to studying scheduling policies in flexible serial lines with two Bernoulli machines and dedicated finite buffers. Priority, cyclic and work-in-process (WIP)-based scheduling policies are investigated. For small scale systems, exact solutions are derived using Markov chain models. For larger ones, a flexible line is decomposed into multiple interacting dedicated serial lines, and iteration procedures are introduced to approximate system production rate. Through extensive numerical experiments, it is shown that the approximation methods result in acceptable accuracy in throughput estimation. In addition, system-theoretic properties such as asymptotic behavior, reversibility, and monotonicity, as well as impact of buffer capacities are discussed, and comparisons of the scheduling policies are carried out.

中文翻译：

---

具有专用有限缓冲区的灵活伯努利线中的调度策略

本文致力于研究具有两台伯努利机和专用有限缓冲区的灵活串行线路中的调度策略。研究了基于优先级、循环和在制品 (WIP) 的调度策略。对于小规模系统，可以使用马尔可夫链模型导出精确解。对于较大的生产线，一条柔性生产线被分解为多个相互作用的专用串行生产线，并引入迭代程序来近似系统生产率。通过大量的数值实验，结果表明近似方法在吞吐量估计方面具有可接受的精度。此外，还讨论了渐近行为、可逆性和单调性等系统理论特性以及缓冲区容量的影响，并对调度策略进行了比较。