Nader Nassif Barsoum and Pandian Vasant and Arijit Bhattacharya and Cvetko Andreeski and T. Kolemisevska and A.T. Dinibütün (2006) Decision making in Toc-Product-Mix selection VIA fuzzy cost function optimization. In: IFAC Conference on Supplemental Ways for Improving International Stability Through Automation ISA '06, 15-17 June 2006, Prishtina.
|
Text
Decision_Making_in_Toc.pdf Download (46kB) | Preview |
Abstract
This paper discusses the fuzzy decision making under the theory-of-constraints (TOC) for the product-mix problem. It utilizes a smooth logistic membership function for finding out the fuzziness patterns in the disparate level of satisfaction. This membership function has been validated for applying to the real-world product-mix problems. This contribution provides a robust, quantified monitoring of the level of satisfaction among the decision makers, and calibrates these levels of satisfaction against the decision-makers expectations. It thus provides a computational intelligence procedure. The solution by Hsu and Chung via the dominance-rule technique yields the optimal throughput as US $ 11,873, which is identical to the solution found by the fuzzy-logic-programming (FLP) methodology, and is considered to be better suited for the product-mix-selection problems. The flexibility of the model lies in the membership function design. The chapter concludes by discussing the inefficiency of the traditional linear programming in handling the multiple bottleneck problems, through the TOC concept via an illustrative example
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Keyword: | Degree of fuzziness; fuzzified linear programming; product-mix decision |
| Subjects: | T Technology > TA Engineering (General). Civil engineering (General) |
| Department: | FACULTY > Faculty of Engineering |
| Depositing User: | ADMIN ADMIN |
| Date Deposited: | 06 Jan 2016 13:30 |
| Last Modified: | 12 Mar 2024 13:13 |
| URI: | https://eprints.ums.edu.my/id/eprint/12751 |
Actions (login required)
 |
View Item |