Weighted Interval Schedule Maximization Problem (ISMP): Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Weighted Interval Schedule Maximization Problem (ISMP) (Interval Scheduling)}} == 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 == Parameters == <pre>n: number of tasks (intervals) k: number of machines (resources)</pre> == Table of Algorithms == Currentl...") |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
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. | ||
Revision as of 12:03, 15 February 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
Parameters
n: number of tasks (intervals)
k: number of machines (resources)
Table of Algorithms
Currently no algorithms in our database for the given problem.