Abstract: This paper considers a scheduling problem in flexible
flow shops environment with the aim of minimizing two important
criteria including makespan and cumulative tardiness of jobs. Since
the proposed problem is known as an Np-hard problem in literature,
we have to develop a meta-heuristic to solve it. We considered
general structure of Genetic Algorithm (GA) and developed a new
version of that based on Data Envelopment Analysis (DEA). Two
objective functions assumed as two different inputs for each Decision
Making Unit (DMU). In this paper we focused on efficiency score of
DMUs and efficient frontier concept in DEA technique. After
introducing the method we defined two different scenarios with
considering two types of mutation operator. Also we provided an
experimental design with some computational results to show the
performance of algorithm. The results show that the algorithm
implements in a reasonable time.
Abstract: This paper considers a multi criteria cell formation
problem in Cellular Manufacturing System (CMS). Minimizing the
number of voids and exceptional elements in cells simultaneously are
two proposed objective functions. This problem is an Np-hard
problem according to the literature, and therefore, we can-t find the
optimal solution by an exact method. In this paper we developed two
ant algorithms, Ant Colony Optimization (ACO) and Max-Min Ant
System (MMAS), based on Data Envelopment Analysis (DEA). Both
of them try to find the efficient solutions based on efficiency concept
in DEA. Each artificial ant is considered as a Decision Making Unit
(DMU). For each DMU we considered two inputs, the values of
objective functions, and one output, the value of one for all of them.
In order to evaluate performance of proposed methods we provided
an experimental design with some empirical problem in three
different sizes, small, medium and large. We defined three different
criteria that show which algorithm has the best performance.