Pages that link to "Item:Q1982880"
From MaRDI portal
The following pages link to Efficient algorithms for the routing open shop with unrelated travel times on cacti (Q1982880):
Displaying 5 items.
- Two-machine routing open shop: How long is the optimal makespan? (Q2117636) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)