A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
From MaRDI portal
(Redirected from Publication:1779528)
A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
Recommendations
- The 2-Machine Routing Open Shop on a Triangular Transportation Network
- Approximation algorithms for two-machine proportionate routing open shop on a tree
- The routing open-shop problem on a network: complexity and approximation
- How the difference in travel times affects the optima localization for the routing open shop
- Efficient approximation algorithms for the routing open shop problem
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 1305102 (Why is no real title available?)
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Group technology approach to the open shop scheduling problem with batch setup times
- Open Shop Scheduling to Minimize Finish Time
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- Two-machine open shop scheduling with special transportation times
- Two-machine shop scheduling problems with batch processing
Cited in
(27)- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
- Approximation algorithms for two-machine proportionate routing open shop on a tree
- Routing open shop and flow shop scheduling problems
- Two-machine routing open shop: How long is the optimal makespan?
- Scheduling in manufacturing with transportation: classification and solution techniques
- Solving the two-machine open shop problem with a single server with respect to the makespan
- Completing partial schedules for open shop with unit processing times and routing
- On the optima localization for the three-machine routing open shop
- On the routing open shop problem with two machines on a two-vertex network
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- The 2-Machine Routing Open Shop on a Triangular Transportation Network
- How the difference in travel times affects the optima localization for the routing open shop
- 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
- An exact solution with an improved running time for the routing flow shop problem with two machines
- A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
- Two-machine open shop problem with a single server and set-up time considerations
- Transporting jobs through a two‐machine open shop
- A survey of scheduling problems with setup times or costs
- \(O(\log m)\)-approximation for the routing open shop problem
- The routing open-shop problem on a network: complexity and approximation
- On complexity of two-machine routing propotionate open shop
- A 3/2 algorithm for two-machine open shop with route-dependent processing times
- On a routing open shop problem on two nodes with unit processing times
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables
This page was built for publication: A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779528)
