Scheduling with semaphore constraints (Q1096534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling with semaphore constraints |
scientific article; zbMATH DE number 4031380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling with semaphore constraints |
scientific article; zbMATH DE number 4031380 |
Statements
Scheduling with semaphore constraints (English)
0 references
1987
0 references
We consider task systems with semaphore constraints, a generalization of the standard deterministic scheduling model that allows a broad class of task dependencies. We show that minimum length scheduling of task systems with semaphore constraints is NP-complete on two processors even when the tasks have identical execution times. In addition, we provide a linear time algorithm for determining the consistency of a task system with semaphore constraints.
0 references
NP-completeness
0 references
semaphore constraints
0 references
minimum length scheduling
0 references
task systems
0 references
linear time algorithm
0 references
