IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
IMI Periodicals >
Serdica Journal of Computing >
2012 >
Volume 6 Number 3 >

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

Title: Variable Neighborhood Search for the File Transfer Scheduling Problem
Authors: Dražić, Zorica
Keywords: Metaheuristics
Scheduling
File Transfers
Variable Neighborhood Search
Optimization
Issue Date: 2012
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 6, No 3, (2012), 333p-348p
Abstract: 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.
Description: ACM Computing Classification System (1998): I.2.8, G.1.6.
URI: http://hdl.handle.net/10525/1936
ISSN: 1312-6555
Appears in Collections:Volume 6 Number 3

Files in This Item:

File Description SizeFormat
sjc-vol6-num3-2012-p333-p348.pdf249.64 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback