Pages that link to "Item:Q3104596"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Routing Shop Scheduling (Q3104596):
Displaying 8 items.
- Efficient approximation algorithms for the routing open shop problem (Q340238) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← links)
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems (Q4545699) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- An exact solution with an improved running time for the routing flow shop problem with two machines (Q6620464) (← links)