Article ID: | iaor2007665 |
Country: | United Kingdom |
Volume: | 44 |
Issue: | 17 |
Start Page Number: | 3509 |
End Page Number: | 3531 |
Publication Date: | Jan 2006 |
Journal: | International Journal of Production Research |
Authors: | Sirikrai V., Yenradee P. |
Keywords: | programming: constraints |
The drum–buffer–rope (DBR) is a scheduling mechanism under the Theory of Constraints (TOC) philosophy. In DBR, ‘drum’ is a production schedule on the capacity-constrained resources (CCRs), which controls the speed of production for the whole system; ‘rope’ is a mechanism to release the required material to the CCRs; and ‘buffer’ is used to protect the CCRs from starvation due to statistical fluctuations. For a non-identical parallel machine flow-shop environment, estimating an efficient rope and time buffer for DBR implementation is not an easy task because of the complexity of non-identical parallel machine loading. This paper proposes a new scheduling method, which is called the modified DBR (MOD-DBR). It applies a backward finite capacity scheduling technique, including machine loadings and detail scheduling, instead of the rope mechanism in DBR. The scheduling performances of MOD-DBR are evaluated under variable processing time situations. The experimental results indicate that the MOD-DBR without a time buffer outperformed the DBR with a considerable level of buffer on the average flow time, while they have the same performance on tardiness, constraint resource utilization, and throughput.