Abstract
The theory of constraints is an approach to production planning and control that emphasizes on the constraints in the system to increase throughput. One application in the theory of constraints is product mix decision. The objective of this paper is to present an algorithm to determine the product mix in a two-constraint resources environment. The theory of constraints solution could not reach optimum solution and has the risk of being infeasible when multiple constraint resources exist. The proposed algorithm is suitable for improving solutions obtained from theory of constraints and could provide throughput in product mix problems. Some alternatives are compared in this paper: the standard theory of constraints, integer linear programming, tabu search, hybrid tabu simulated annealing, and proposed algorithm solution. The numerical result shows the advantages of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
