Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1604

 Title: Solving the Task Assignment Problem with a Variable Neighborhood Search Authors: Kratica, JozefSavić, AleksandarFilipović, VladimirMilanović, Marija Keywords: Task AssignmentMultiprocessor SystemsVariable Neighborhood SearchAssignment ProblemsCombinatorial Optimization Issue Date: 2010 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 4, No 4, (2010), 435p-446p Abstract: In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time. URI: http://hdl.handle.net/10525/1604 ISSN: 1312-6555 Appears in Collections: Volume 4 Number 4

Files in This Item:

File Description SizeFormat