Efficient approximation algorithms for the routing open shop problem
From MaRDI portal
Publication:340238
DOI10.1016/J.COR.2012.01.006zbMATH Open1349.90330OpenAlexW1979032346MaRDI QIDQ340238FDOQ340238
Authors: Ilya Chernykh, Alexander Kononov, Sergey Sevastyanov 
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.01.006
Recommendations
- The Routing Open Shop Problem: New Approximation Algorithms
- \(O(\log m)\)-approximation for the routing open shop problem
- The routing open-shop problem on a network: complexity and approximation
- Routing open shop with unrelated travel times
- Improved Approximation Algorithms for Routing Shop Scheduling
Cited In (22)
- Efficient algorithms for the routing open shop with unrelated travel times on cacti
- The open shop problem with routing at a two-node network and allowed preemption
- Two-machine routing open shop: How long is the optimal makespan?
- Routing open shop and flow shop scheduling problems
- Scheduling in manufacturing with transportation: classification and solution techniques
- Completing partial schedules for open shop with unit processing times and routing
- The Routing Open Shop Problem: New Approximation Algorithms
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Improved Approximation Algorithms for Routing Shop Scheduling
- Irreducible bin packing and normality in routing open shop
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- \(O(\log m)\)-approximation for the routing open shop problem
- Routing open shop with unrelated travel times
- The routing open-shop problem on a network: complexity and approximation
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
- The LPT heuristic for minimizing total load on a proportionate openshop
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables
- A branch \(\&\) bound algorithm for the open-shop problem
- Approximation algorithms for two-machine proportionate routing open shop on a tree
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
This page was built for publication: Efficient approximation algorithms for the routing open shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340238)
