An improved algorithm for optimizing product mix under the theory of constraints
Authors:
- 15 October 2004
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 42 (20) , 4221-4233
Abstract
One of the most important decisions made in production systems is determining the product mix in such a way that maximum throughput would be obtained. Several algorithms to determine the product mix under the theory of constraints (TOC) have been developed. In this paper, the inefficiency of the traditional TOC algorithm in handling the multiple bottleneck problem is discussed through an example. Then, the latest algorithm and its disadvantages will be discussed and an improved algorithm, which is much more efficient and can reach the optimum solution with considerable speed, will be presented. Finally, the improved algorithm and the integer linear programming (ILP) method will be compared with each other through the example.Keywords
This publication has 3 references indexed in Scilit:
- Improving the product mix heuristic in the theory of constraintsInternational Journal of Production Research, 1997
- Optimizing theory of constraints when multiple constrained resources existEuropean Journal of Operational Research, 1993
- Theory of constraints and linear programming: a comparisonInternational Journal of Production Research, 1992