Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)
本文正式提出了鼓-缓冲-绳子（DBR）系统试图解决的生产调度问题，并在多约束基准问题上评估了Goldratt研究所软件中求解算法的解质量，发现按最佳顺序调度约束通常能得到良好结果。
This paper seeks to advance the current understanding of constraint scheduling in several ways. First, it describes the need for constraint scheduling in DBR systems. It then formally presents the production scheduling problem DBR attempts to solve and relates that formulation to prior research. Finally, it evaluates the quality of solutions produced by the solution algorithm incorporated by the Goldratt Institute (and now maintained by the TOC Center's Goal Systems Group) in their production software on a set of benchmark problems involving multiple constraints. The results show that generally good results can be obtained as long as the constraints are scheduled in the best sequence.