A Problem of Scheduling Jobs with Non-Monotonic Stepwise Values

DOI10.15388/INFORMATICA.2014.03zbMath1316.68031OpenAlexW1037492119MaRDI QIDQ5262425

Tomasz Krysiak, Radosław Trela, Adam Janiak

Publication date: 15 July 2015

Published in: Informatica (Search for Journal in Brave)

Full work available at URL: http://content.iospress.com/articles/informatica/inf25-1-03

zbMATH Keywords

schedulingheuristicparallel processorspseudo-polynomial algorithmnonmonotonic job value

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: A Problem of Scheduling Jobs with Non-Monotonic Stepwise Values