Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree (Q2026152)
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: Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree |
scientific article; zbMATH DE number 7349415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree |
scientific article; zbMATH DE number 7349415 |
Statements
Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree (English)
0 references
18 May 2021
0 references
scheduling
0 references
routing open shop
0 references
preemption
0 references
polynomially solvable subclass
0 references
overloaded node
0 references
overloaded edge
0 references
