Pages that link to "Item:Q3133222"
From MaRDI portal
The following pages link to The 2-Machine Routing Open Shop on a Triangular Transportation Network (Q3133222):
Displaying 8 items.
- Two-machine routing open shop: How long is the optimal makespan? (Q2117636) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← 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)
- 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)