Variable neighborhood search for the file transfer scheduling problem

Abstract

In this paper a file transfer scheduling problem is considered.This problem is known to be NP-hard, and thus provides a challenging areafor metaheuristics. A variable neighborhood search algorithm is designedfor the transfer scheduling of files between various nodes ofa network, bywhich the overall transfer times are to be minimized. Optimality of VNSsolutions on smaller size instances has been verified by total enumeration.For several larger instances optimality follows from reaching the elementarylower bound of a problem.