DC FieldValueLanguage
dc.contributor.authorMatijević, Lukaen_US
dc.contributor.authorStanković, Unaen_US
dc.contributor.authorDavidović, Tatjanaen_US
dc.date.accessioned2021-12-01T11:47:00Z-
dc.date.available2021-12-01T11:47:00Z-
dc.date.issued2021-
dc.identifier.isbn978-86-7589-151-2-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4715-
dc.description.abstractWe consider a non-preemptive scheduling problem with deadlines and release times, where each task is associated also a nonnegative weight, representing price to be rewarded when task is scheduled for execution. The problem consists of finding a subset of tasks that are going to be scheduled and ordering them in such a way to maximize the price (sum of weights) of all scheduled tasks. Since the problem is NP-hard, we propose a metaheuristic approach, using the General Variable Neighborhood Search (GVNS). This approach is tested on a set of randomly generated instances, and the results obtained this way suggest that GVNS is able to find a high-quality solutions in a short amount of time.en_US
dc.publisherUniversity of Belgrade, Faculty of Mathematicsen_US
dc.relationAdvanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBCen_US
dc.subjectcombinatorial optimization | scheduling problem | identical machines | metaheuristicsen_US
dc.titleGeneral variable neighborhood search for the weighted scheduling problem with deadlines and release timesen_US
dc.typeConference Paperen_US
dc.relation.conferenceXLVIII International Symposium on Operational Research, SYM-OP-IS 2021, Banja Koviljača, 20-23. septembar 2021.en_US
dc.identifier.urlhttp://www.mi.sanu.ac.rs/~tanjad/MSD21-GVNSschedSYMOPIS2021.pdf-
dc.identifier.urlhttp://symopis2021.matf.bg.ac.rs/download/Zbornik-SYM-OP-IS2021.pdf-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage207-
dc.relation.lastpage212-
dc.description.rankM33-
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0002-4575-6720-
crisitem.author.orcid0000-0002-5347-124X-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/AI4TrustBC/description.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/AI4TrustBC/participants.php-
Show simple item record

Page view(s)

90
checked on May 9, 2024

Google ScholarTM

Check

Altmetric


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