Article ID: | iaor20082348 |
Country: | United Kingdom |
Volume: | 45 |
Issue: | 15 |
Start Page Number: | 3421 |
End Page Number: | 3437 |
Publication Date: | Jan 2007 |
Journal: | International Journal of Production Research |
Authors: | Tsai W.-H., Lai C.-W., Chang J.C. |
Keywords: | programming: constraints, scheduling |
A particular decision-making process that is needed by most firms who produce joint products is the one requiring an assessment of desirability of further processing joint products beyond the split-off point. The purpose of this paper is to develop an algorithm for optimizing a joint products further processing decision under the theory of constraints. To fit the jointly produced characteristic of joint products and the sequential produced characteristic between each joint product and its further processing product, the algorithm is composed of seven steps. These steps consider every bottleneck resource to the decision-making process by computing a priority ratio to establish its priority sequence. According to the priority sequence of the most constrained resource, the initial master production schedule is developed. Then, the following steps find the best path to reach the optimal solution under the guidance of all bottleneck resources. Due to its accessibility and comprehensibility, the TOC-based algorithm developed by this paper is a practical tool for obtaining the optimal joint products further processing decision.