Weighted Interval Schedule Maximization Problem (ISMP): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Related Problems == | == Related Problems == | ||
Related: [[Unweighted Interval Scheduling]] | Related: [[Unweighted Interval Scheduling]], [[Unweighted Interval Scheduling, Online]] | ||
== Parameters == | == Parameters == | ||
n: number of tasks (intervals) | $n$: number of tasks (intervals) | ||
k: number of machines (resources) | $k$: number of machines (resources) | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 07:53, 10 April 2023
Description
In Weighted Interval Scheduling, each interval has an associated weight. The goal is to maximize the weights of the accepted (and not interrupted) intervals.
Related Problems
Related: Unweighted Interval Scheduling, Unweighted Interval Scheduling, Online
Parameters
$n$: number of tasks (intervals)
$k$: number of machines (resources)
Table of Algorithms
Currently no algorithms in our database for the given problem.