In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article will consider the problem of scheduling multiprocessor tasks with multi–criteria, namely, minimizing total completion time (makespan) and minimizing the number of tardy tasks and shows that most efficient schedule(s) will be determined.
S. Hosseini Shirvani, M. and Alinejad-Rokny, Hamid
"Performance Assessment of Feasible Scheduling Multiprocessor Tasks Solutions by using DEA FDH method,"
Information Sciences Letters: Vol. 1
, Article 6.
Available at: https://digitalcommons.aaru.edu.jo/isl/vol1/iss2/6