The robot sequencing problem: polynomial algorithm and complexity (Q3713849): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The robot sequencing problem: polynomial algorithm and complexity |
scientific article |
Statements
The robot sequencing problem: polynomial algorithm and complexity (English)
0 references
1985
0 references
directed graphs
0 references
vertex packing problem
0 references
sequencing robot activities
0 references
precedence constraints
0 references
NP-hard
0 references
special case
0 references
polynomial-time algorithm
0 references