@article{(Open Science Index):https://publications.waset.org/pdf/13334,
	  title     = {Scheduling a Flexible Flow Shops Problem using DEA},
	  author    = {Fatemeh Dadkhah and  Hossein Ali Akbarpour},
	  country	= {},
	  institution	= {},
	  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.},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {6},
	  number    = {1},
	  year      = {2012},
	  pages     = {69 - 73},
	  ee        = {https://publications.waset.org/pdf/13334},
	  url   	= {https://publications.waset.org/vol/61},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 61, 2012},