A NEW HEURISTIC APPROACH TO SOLVE PRODUCT MIX PROBLEMS IN A MULTI-BOTTLENECK SYSTEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RASHIDI KOMIJAN A.R.; ARIANEZHAD M.B.; MAKOUI A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2009 | Volume:5 | Issue:9 Page(s): 46-57

Download Full-Text

View:

298

Download:

128

Cites:

Information Journal Paper

Title

A NEW HEURISTIC APPROACH TO SOLVE PRODUCT MIX PROBLEMS IN A MULTI-BOTTLENECK SYSTEM

Author(s)

RASHIDI KOMIJAN A.R. | ARIANEZHAD M.B. | MAKOUI A. | Issue Writer Certificate

Keywords

PRODUCT MIX PROBLEM

THEORY OF CONSTRAINTS

GROUP DECISION-MAKING

INTEGER LINEAR PROGRAMMING

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 PROBLEMs that is efficient both in single and multi-bottleneck problems. At first, the new algorithm uses a mathematical model to aggregate different priorities assigned to products by different bottlenecks and finds an initial 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.

Cites

No record.

References

No record.

Cite

APA: Copy

RASHIDI KOMIJAN, A.R., ARIANEZHAD, M.B., & MAKOUI, A.. (2009). A NEW HEURISTIC APPROACH TO SOLVE PRODUCT MIX PROBLEMS IN A MULTI-BOTTLENECK SYSTEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 5(9), 46-57. SID. https://sid.ir/paper/309839/en

Vancouver: Copy

RASHIDI KOMIJAN A.R., ARIANEZHAD M.B., MAKOUI A.. A NEW HEURISTIC APPROACH TO SOLVE PRODUCT MIX PROBLEMS IN A MULTI-BOTTLENECK SYSTEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2009;5(9):46-57. Available from: https://sid.ir/paper/309839/en

IEEE: Copy

A.R. RASHIDI KOMIJAN, M.B. ARIANEZHAD, and A. MAKOUI, “A NEW HEURISTIC APPROACH TO SOLVE PRODUCT MIX PROBLEMS IN A MULTI-BOTTLENECK SYSTEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 5, no. 9, pp. 46–57, 2009, [Online]. Available: https://sid.ir/paper/309839/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops