An improved algorithm for optimising product mix under the theory of constraints

An improved algorithm for optimising product mix under the theory of constraints

0.00 Avg rating0 Votes
Article ID: iaor20051692
Country: United Kingdom
Volume: 42
Issue: 20
Start Page Number: 4221
End Page Number: 4233
Publication Date: Jan 2004
Journal: International Journal of Production Research
Authors: ,
Keywords: theory of constraints, product mix
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 method will be compared with each other through the example.

Reviews

Required fields are marked *. Your email address will not be published.