1Ph.D., Dep. of Industrial Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran
2Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
3Assistant Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Abstract
Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, the new algorithm uses a mathe-matical model to aggregate different priorities assigned to products by different bottlenecks and finds an ini-tial solution. Then tries to improve the solution by solving a set of linear inequalities. It is shown that the new approach obtains better solutions than the previous algorithms.
Top