Authors: Stanković, Una 
Matijević, Luka 
Davidović, Tatjana 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Mathematical models for the weighted scheduling problem with deadlines and release times
First page: 327
Last page: 332
Conference: XLVIII International Symposium on Operational Research, SYM-OP-IS 2021, Banja Koviljača, 20-23. septembar 2021.
Issue Date: 2021
Rank: M33
ISBN: 978-86-7589-151-2
We consider a non-preemptive version of the scheduling problem with multiple identical machines,
deadlines, release times, and task weights. The main goal is to select a subset of tasks to be scheduled for execution in such a way to maximize the total sum of weights of all scheduled tasks. For this purpose, we devise two different mathematical formulations and test them on a set of randomly generated instances using the GNU Linear Programming Kit as a solver.
Keywords: Task scheduling | Multiple machines | Mixed-Integer linear program | Combinatorial optimization | Exact solver
Publisher: University of Belgrade, Faculty of Mathematics
Project: Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC 

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM



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