A Decomposition Algorithm for Sequencing with General Precedence Constraints (Q3962769): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.6.2.190 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004883212 / rank | |||
Normal rank | |||
Latest revision as of 18:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Decomposition Algorithm for Sequencing with General Precedence Constraints |
scientific article |
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
