Pages that link to "Item:Q5247701"
From MaRDI portal
The following pages link to O(log m)-approximation for the routing open shop problem (Q5247701):
Displaying 6 items.
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← 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)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
