A Decomposition Algorithm for Sequencing with General Precedence Constraints (Q3962769)
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: A Decomposition Algorithm for Sequencing with General Precedence Constraints |
scientific article; zbMATH DE number 3784626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Decomposition Algorithm for Sequencing with General Precedence Constraints |
scientific article; zbMATH DE number 3784626 |
Statements
A Decomposition Algorithm for Sequencing with General Precedence Constraints (English)
0 references
1981
0 references
unconstrained job sequencing
0 references
adjacent job interchange property
0 references
adjacent sequence interchange property
0 references
existence of decomposition algorithms
0 references
general precedence structures
0 references
two-machine maximum flow time problem
0 references
maximum cumulative cost problem
0 references
least cost fault detection problem
0 references
total weighted exponential completion time problem
0 references
sufficient condition for the existence of efficient algorithms
0 references
series-parallel precedence constraints
0 references
