Geodesic
Variable Neighborhood Search for the File Transfer Scheduling Problem
Serdica Journal of Computing, Tome 6 (2012) no. 3, pp. 333-348

Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library

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.
Keywords: Metaheuristics, Scheduling, File Transfers, Variable Neighborhood Search, Optimization 
@article{SJC_2012_6_3_a5,
     author = {Dra\v{z}i\'c, Zorica},
     title = {Variable {Neighborhood} {Search} for the {File} {Transfer} {Scheduling} {Problem}},
     journal = {Serdica Journal of Computing},
     pages = {333--348},
     publisher = {mathdoc},
     volume = {6},
     number = {3},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SJC_2012_6_3_a5/}
}
TY  - JOUR
AU  - Dražić, Zorica
TI  - Variable Neighborhood Search for the File Transfer Scheduling Problem
JO  - Serdica Journal of Computing
PY  - 2012
SP  - 333
EP  - 348
VL  - 6
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJC_2012_6_3_a5/
LA  - en
ID  - SJC_2012_6_3_a5
ER  - 
%0 Journal Article
%A Dražić, Zorica
%T Variable Neighborhood Search for the File Transfer Scheduling Problem
%J Serdica Journal of Computing
%D 2012
%P 333-348
%V 6
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJC_2012_6_3_a5/
%G en
%F SJC_2012_6_3_a5
Dražić, Zorica. Variable Neighborhood Search for the File Transfer Scheduling Problem. Serdica Journal of Computing, Tome 6 (2012) no. 3, pp. 333-348. http://geodesic.mathdoc.fr/item/SJC_2012_6_3_a5/