An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586)
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: An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times |
scientific article |
Statements
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (English)
0 references
9 May 2019
0 references
FPT-algorithm
0 references
Open Shop problem
0 references
routing
0 references
scheduling
0 references
UET
0 references
parameterized complexity
0 references
0.90656483
0 references
0.90270877
0 references
0.8989564
0 references
0.89624465
0 references
0.8892216
0 references
0.8879662
0 references
0.88772655
0 references
0.8826138
0 references
0.88131964
0 references
0.87989616
0 references
