In this paper, a new method for handling multicriteria fuzzy decision-making problems based on intuitionistic fuzzy sets is presented. The proposed method allows the degrees of satisfiability and non-satisfiability of each alternative with respect to a set of criteria to be represented by intuitionistic fuzzy sets, respectively. Furthermore, the proposed method allows the decision-maker to assign the degrees of membership and non-membership of the criteria to the fuzzy concept "importance." The method proposed here can provide a useful way to efficiently help the decision-maker to make his decision.

No abstract

The paper is devoted to some flow-shop scheduling problems with a learning effect. The objective is to minimize one of the two regular performance criteria, namely, makespan and total flowtime. A heuristic algorithm with worst-case bound m for each criteria is given, where m is the number of machines. Furthermore, a polynomial algorithm is proposed for both of the special cases: identical processing time on each machine and an increasing series of dominating machines. An example is also constructed to show that the classical Johnson's rule is not the optimal solution for the two-machine flowshop scheduling to minimize makespan with a learning effect. Some extensions of the problem are also shown.

An optimization model with one linear objective function and fuzzy relation equation constraints was presented by Fang and Li (1999) as well as an efficient solution procedure was designed by them for solving such a problem. A more general case of the problem, an optimization model with one linear objective function and finitely many constraints of fuzzy relation inequalities, is investigated in this paper. A new approach for solving this problem is proposed based on a necessary condition of optimality given in the paper. Compared with the known methods, the proposed algorithm shrinks the searching region and hence obtains an optimal solution fast. For some special cases, the proposed algorithm reaches an optimal solution very fast since there is only one minimum solution in the shrunk searching region. At the end of the paper, two numerical examples are given to illustrate this difference between the proposed algorithm and the known ones.

No abstract

No abstract

No abstract

No abstract