Pages that link to "Item:Q5085264"
From MaRDI portal
The following pages link to Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264):
Displaying 5 items.
- Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree (Q2026152) (← links)
- Two-machine routing open shop: How long is the optimal makespan? (Q2117636) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- On the routing open shop problem with two machines on a two-vertex network (Q5263766) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)