摘要：Fox gave the theory of constraints heuristics (TOCh) to determine the optimal product mix. This algorithm was modified by Lea for multiple constraint situations. Neither of these heuristics is applicable in the situations where complete shipment is an additional constraint. In this paper, some modifications are suggested in TOCh. With these modifications, the heuristics can be used in the complete shipment constraint situations. The working of the modified heuristics has been explained by taking two numerical examples. By comparing the results obtained from this heuristics with those obtained from integer linear programming model, it has been proved that the model gives satisfactory results.
关键词：Theory of Constraints;Theory of Constraints heuristics (TOCh);Integer Linear Programming Model
