# Disjunctive Scheduling

## Problem Description

Given a set of task intervals each of which has a fixed duration, an earliest start time, and a latest end time; a set of precedence constraints each of which states that one task must be completed before another; and a set of disjunctive constraints each of which states that two task intervals cannot overlap each other. The goal of disjunctive scheduling is to assign a start time (an integer) to each task such that the given constraints are all satisfied.

## Input format

## Output format

## Example

## Author(s)

Author: Neng-Fa Zhou

Affiliation: CUNY Brooklyn College and Graduate Center, USA