Pages that link to "Item:Q5263766"
From MaRDI portal
The following pages link to On the routing open shop problem with two machines on a two-vertex network (Q5263766):
Displaying 14 items.
- A 3/2 algorithm for two-machine open shop with route-dependent processing times (Q1806706) (← links)
- Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree (Q2026152) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← 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)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- The 2-Machine Routing Open Shop on a Triangular Transportation Network (Q3133222) (← links)
- Routing Two-Machine Flowshop Problems on Networks with Special Structure (Q4346443) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← 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)
