Pages that link to "Item:Q2496075"
From MaRDI portal
The following pages link to The routing open-shop problem on a network: complexity and approximation (Q2496075):
Displaying 26 items.
- Efficient approximation algorithms for the routing open shop problem (Q340238) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← 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)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
- The 2-Machine Routing Open Shop on a Triangular Transportation Network (Q3133222) (← links)
- The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- Routing Two-Machine Flowshop Problems on Networks with Special Structure (Q4346443) (← links)
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems (Q4545699) (← 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)
- On the routing open shop problem with two machines on a two-vertex network (Q5263766) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← 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)
- An exact solution with an improved running time for the routing flow shop problem with two machines (Q6620464) (← links)
