| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] |
¡@
Huey-Ming Lee+ and Jershan Chiang
+Department of Information Management
Department of Applied Mathematics
Chinese Culture University
Taipei, 111 Taiwan
+E-mail: hmlee@faculty.pccu.edu.tw
In crisp production inventory problem, let q, a, b, d, R and r be the quantity produced
per cycle, the holding cost, production cost, production quantity per day, the total
demand quantity and the demand quantity per day, respectively. We consider three fuzzification
methods. Firstly, we fuzzify q, a, b, d, R and r to triangular fuzzy numbers.
Secondly, we fuzzify d and r to triangular fuzzy number with q, a, b and R staying in
crisp case. Thirdly, we fuzzify q to triangular fuzzy number with a, b, d, R and r staying
in crisp case. In three cases, we find the total costs in the fuzzy sense by signed distance
and get the optimal solutions.
Received November 3, 2005; revised February 8 & April 27, 2006; accepted June 15, 2006.
Communicated by Jenq-Neng Hwang.
*This work was supported in part by the National Science Council of Taiwan, R.O.C., under grant No. NSC
93-2416-H-034-003.