Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Serdica Journal of Computing, Vol. 6, No 3, (2012), 333p-348p
In this paper a file transfer scheduling problem is considered.
This problem is known to be NP-hard, and thus provides a challenging area
for metaheuristics. A variable neighborhood search algorithm is designed
for the transfer scheduling of files between various nodes of a network, by
which the overall transfer times are to be minimized. Optimality of VNS
solutions on smaller size instances has been verified by total enumeration.
For several larger instances optimality follows from reaching the elementary
lower bound of a problem.
ACM Computing Classification System (1998): I.2.8, G.1.6.