[Show abstract][Hide abstract] ABSTRACT: Owing to more vague concepts frequently represented in decision data, mathematical objects introduced by K.T. Atanassov and studied under the name “intuitionistic fuzzy set” (IFS) are more flexibly used to model real-life decision situations. The aim of this paper is to develop a new methodology for solving multi-attribute group decision-making problems using IFS, in which multiple attributes are explicitly considered. In this methodology, for each decision maker in the group two auxiliary fractional programming models are derived from the TOPSIS to determine the relative closeness coefficient intervals of alternatives, which are aggregated for the group to generate the ranking order of all alternatives by computing their optimal degrees of membership based on the ranking method of interval numbers. The implementation process of the method proposed in this paper is illustrated with a numerical example.
[Show abstract][Hide abstract] ABSTRACT: This paper investigates single-machine scheduling problems with deteriorating jobs and the group technology (GT) assumption.
By deteriorating jobs and the group technology assumption, we mean that the group setup times and job processing times are
both increasing functions of their starting times, i.e., the group setup times and job processing times are both described
by a function which is proportional to a linear function of time. The two objectives of scheduling problems are to minimize
the makespan and the total weighted completion time, respectively. We show that these problems remain solvable in polynomial
time when deterioration and group technology are considered simultaneously.
International Journal of Advanced Manufacturing Technology 10/2008; 39(7):808-812. DOI:10.1007/s00170-007-1255-x · 1.46 Impact Factor
[Show abstract][Hide abstract] ABSTRACT: In this paper we consider the flow shop scheduling problems with the effects of learning and deterioration. In this model
the processing times of a job is defined as a function of its starting time and position in a sequence. The scheduling objective
functions are makespan and total completion time. We prove that even with the introduction of learning effect and deteriorating
jobs to job processing times, some special flow shop scheduling problems remain polynomially solvable.
Journal of Applied Mathematics and Computing 02/2008; 26(1):367-379. DOI:10.1007/s12190-007-0033-0
[Show abstract][Hide abstract] ABSTRACT: This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.
Journal of Applied Mathematics and Computing 05/2007; 24(1-2). DOI:10.1007/BF02832317
[Show abstract][Hide abstract] ABSTRACT: A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm,
a method due to Pang, Han and Pangaraj (1991), , is employed to solve a subproblem for constructing search directions.
The convergence analysis is given as well.
Journal of Applied Mathematics and Computing 04/2007; 24(1):333-342. DOI:10.1007/BF02832322
[Show abstract][Hide abstract] ABSTRACT: In this paper, an concept and some properties of approximate U-Lagrangian are presented. They can be reviewed as an extension to the ones of U-Lagrangian. An algorithm for solving an unconstrained minimization problem and the convergence analysis are given when the UV-decomposition exists.
[Show abstract][Hide abstract] ABSTRACT: This paper deals with some special cases of general, no-wait and no-idle permutation flow shop scheduling problems, respectively. Special cases means that the machines form an increasing series of dominant machines, a decreasing series of dominant machines, an increasing–decreasing series of dominant machines and a decreasing–increasing series of dominant machines. Efficient polynomial time algorithms for finding the optimal schedules to minimize discounted total weighted completion time are developed.
[Show abstract][Hide abstract] ABSTRACT: The aim of this paper is to point out and correct some errors of properties of the four operators defined over the IFSs in Atanassov (Intuitionistic Fuzzy Sets, Springer, Heidelberg, 1999).
Fuzzy Sets and Systems 08/2005; 154(1):151-155. DOI:10.1016/j.fss.2005.03.004 · 1.99 Impact Factor