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

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.