Abstract
|
Article Information:
Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA
Hamed Hosseini
Corresponding Author: Hamed Hosseini
Submitted: 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.
Key words: Linear programming, non-convex DEA, NP-complete, , , ,
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Hamed Hosseini, . Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA. Research Journal of Applied Sciences, Engineering and Technology, (14): 3774-3776.
|
|
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|