Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264)
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: Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass |
scientific article; zbMATH DE number 7548207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass |
scientific article; zbMATH DE number 7548207 |
Statements
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (English)
0 references
27 June 2022
0 references
scheduling
0 references
open shop with delays
0 references
routing open shop
0 references
standard lower bound
0 references
instance reduction
0 references
polynomially solvable subclass
0 references
overloaded node
0 references
overloaded edge
0 references
0 references
0 references
0 references
0 references
0.92472494
0 references
0.9037654
0 references
0.8985147
0 references
0.87893367
0 references
0.8727354
0 references
0.8682971
0 references
0.85769063
0 references
0.8569207
0 references
0.8553005
0 references
