welcome: please sign in
location: Diff for "ProblemsDescription/DisjunctiveScheduling"
Differences between revisions 2 and 4 (spanning 2 versions)
⇤ ← Revision 2 as of 2011-01-10 10:04:33 →
Size: 672
Editor: CarmenSantoro
Comment:
← Revision 4 as of 2011-01-10 11:08:31 → ⇥
Size: 718
Editor: CarmenSantoro
Comment:
Deletions are marked like this. Additions are marked like this.
Line 18: Line 18:
Affiliation: Affiliation: CUNY Brooklyn College and Graduate Center, USA

Disjunctive Scheduling

Contents

  1. Disjunctive Scheduling
    1. Problem Description
    2. Input format
    3. Output format
    4. Example
    5. Author(s)

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

ASP Competition 2011: ProblemsDescription/DisjunctiveScheduling (last edited 2011-01-10 11:08:31 by CarmenSantoro)