Research Article | OPEN ACCESS
Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA
Hamed Hosseini
Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran,
Tel.: 00989121793734
Research Journal of Applied Sciences, Engineering and Technology 2013 14:3774-3776
Received: September 15, 2012 | Accepted: October 30, 2012 | Published: April 20, 2013
Abstract
An attempt has been investigated to show how applying DEA selected the most efficient among feasible solutions in parallel processing scheduling. One of the most important things between possible solutions is to determine the most efficient one. It will happen in NP-Complete problems when we are compelled to make heuristic algorithms to solve the problem. Maybe the heuristic proposed algorithm gives us some possible solutions. To reach the goal we are supposed to apply one decision maker. DEA model based on linear programming is widely used to make decision. This study will illustrate how DEA works on parallel scheduling problem and select the most efficient solution within which the objective is to minimize completion time and to minimize the number of tardy jobs.
Keywords:
Linear programming, non-convex DEA, NP-complete,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
![](http://www.maxwellsci.com/images/RJASET-maxw.jpg) |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
![Submit Manuscript](../images/sub.jpg) |
Information |
|
|
|
Sales & Services |
|
|
|