Weighted Interval Schedule Maximization Problem (ISMP) (Interval Scheduling)

From Algorithm Wiki
Revision as of 07:53, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Weighted_Interval_Schedule_Maximization_Problem_(ISMP)&oldid=46857"