1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2900
DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorSavić, Aleksandaren_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorMilanović, Marijaen_US
dc.date.accessioned2025-11-10T14:59:57Z-
dc.date.available2025-11-10T14:59:57Z-
dc.date.issued2010-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/2900-
dc.description.abstractIn this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time.en_US
dc.language.isoenen_US
dc.publisherSofia : Institute of Mathematics and Informatics of the Bulgarian Academy of Sciencesen_US
dc.relation.ispartofSerdica Journal of Computingen_US
dc.subjectTask assignmenten_US
dc.subjectmultiprocessor systemsen_US
dc.subjectVariable neighborhood searchen_US
dc.subjectassignment problemsen_US
dc.subjectCombinatorial optimizationen_US
dc.titleSolving the Task Assignment Problem with a Variable Neighborhood Searchen_US
dc.typeArticleen_US
dc.identifier.urlhttps://serdica-comp.math.bas.bg/index.php/serdicajcomputing/article/view/sjc.2010.4.435-446-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn1312-6555en_US
dc.relation.firstpage435en_US
dc.relation.lastpage446en_US
dc.relation.volume4en_US
dc.relation.issue4en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0009-0003-8568-4260-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


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