Pages that link to "Item:Q3558915"
From MaRDI portal
The following pages link to The Routing Open Shop Problem: New Approximation Algorithms (Q3558915):
Displaying 12 items.
- Efficient approximation algorithms for the routing open shop problem (Q340238) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Efficient algorithms for the routing open shop with unrelated travel times on cacti (Q1982880) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Improved Approximation Algorithms for Routing Shop Scheduling (Q3104596) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)