Using precedence intervals to solve constrained precedence problems (Q3659515): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Linear Ordering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Method for optimzing functionals of permutations in the presence of constraints / rank | |||
Normal rank | |||
Latest revision as of 09:21, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using precedence intervals to solve constrained precedence problems |
scientific article |
Statements
Using precedence intervals to solve constrained precedence problems (English)
0 references
1982
0 references
sequencing
0 references
precedence problems
0 references
strict order binary relation
0 references
permutation
0 references
acyclic directed graph
0 references
precedence intervals
0 references
optimal solution
0 references
0 references
