Pages that link to "Item:Q340238"

The following pages link to Efficient approximation algorithms for the routing open shop problem (Q340238):

Displaying 20 items.

• Routing open shop and flow shop scheduling problems (Q421573) (← links)
• A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← 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)
• 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)
• 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)
• The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← 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)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
• Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
• Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)