Universal Journal of Management Vol. 4(12), pp. 670 - 677
DOI: 10.13189/ujm.2016.041203
Reprint (PDF) (314Kb)

Modified Theory of Constraints Heuristics(MTOCh1) Keeping Complete Shipment as Constraint

Ajay Gupta ^*
Department of Industrial & Production Engineering, National Institute of Technology Jalandhar, India

ABSTRACT

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.

KEYWORDS
Theory of Constraints, Theory of Constraints heuristics (TOCh), Integer Linear Programming Model

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Ajay Gupta , "Modified Theory of Constraints Heuristics(MTOCh1) Keeping Complete Shipment as Constraint," Universal Journal of Management, Vol. 4, No. 12, pp. 670 - 677, 2016. DOI: 10.13189/ujm.2016.041203.

(b). APA Format:
Ajay Gupta (2016). Modified Theory of Constraints Heuristics(MTOCh1) Keeping Complete Shipment as Constraint. Universal Journal of Management, 4(12), 670 - 677. DOI: 10.13189/ujm.2016.041203.