Variable Neighborhood Search for the File Transfer Scheduling Problem

Dražić, Zorica. "Variable Neighborhood Search for the File Transfer Scheduling Problem." Serdica Journal of Computing 6.3 (2012): 333-348. <http://eudml.org/doc/219631>.

@article{Dražić2012,
abstract = {ACM Computing Classification System (1998): I.2.8, G.1.6.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.},
author = {Dražić, Zorica},
journal = {Serdica Journal of Computing},
keywords = {Metaheuristics; Scheduling; File Transfers; Variable Neighborhood Search; Optimization},
language = {eng},
number = {3},
pages = {333-348},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Variable Neighborhood Search for the File Transfer Scheduling Problem},
url = {http://eudml.org/doc/219631},
volume = {6},
year = {2012},
}

TY - JOUR
AU - Dražić, Zorica
TI - Variable Neighborhood Search for the File Transfer Scheduling Problem
JO - Serdica Journal of Computing
PY - 2012
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 6
IS - 3
SP - 333
EP - 348
AB - ACM Computing Classification System (1998): I.2.8, G.1.6.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.
LA - eng
KW - Metaheuristics; Scheduling; File Transfers; Variable Neighborhood Search; Optimization
UR - http://eudml.org/doc/219631
ER -