A problem of scheduling jobs with non-monotonic stepwise values

DOI10.15388/INFORMATICA.2014.03zbMATH Open1316.68031OpenAlexW1037492119MaRDI QIDQ5262425FDOQ5262425

Tomasz Krysiak, Radosław Trela, Adam Janiak

Publication date: 15 July 2015

Published in: Informatica (Vilnius) (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 2159168
• Single processor scheduling with job values depending on their completion times
• A scheduling problem with job values given as a power function of their completion times
• Scheduling on parallel processors with varying processing times
• Scheduling jobs with piecewise linear decreasing processing times

zbMATH Keywords

heuristicschedulingpseudo-polynomial algorithmparallel processorsnonmonotonic job value

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) 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)

Cited In (3)

• A scheduling problem with job values given as a power function of their completion times
• Title not available (Why is that?)
• Single processor scheduling with job values depending on their completion times

This page was built for publication: A problem of scheduling jobs with non-monotonic stepwise values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262425)