Home           Contact us           FAQs           
   Journal Page   |   Aims & Scope   |   Author Guideline   |   Editorial Board   |   Search
2013 (Vol. 5, Issue: 14)
Article Information:

Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA

Hamed Hosseini
Corresponding Author:  Hamed Hosseini 

Key words:  Linear programming, non-convex DEA, NP-complete, , , ,
Vol. 5 , (14): 3774-3776
Submitted Accepted Published
September 15, 2012 October 30, 2012 April 20, 2013

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.
Abstract PDF HTML
  Cite this Reference:
Hamed Hosseini, 2013. Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA.  Research Journal of Applied Sciences, Engineering and Technology, 5(14): 3774-3776.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
   Contact Information
  Executive Managing Editor
  Email: admin@maxwellsci.com
  Publishing Editor
  Email: support@maxwellsci.com
  Account Manager
  Email: faisalm@maxwellsci.com
  Journal Editor
  Email: admin@maxwellsci.com
  Press Department
  Email: press@maxwellsci.com
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2009. MAXWELL Science Publication, a division of MAXWELLl Scientific Organization. All rights reserved