Approximation algorithms for two-machine proportionate routing open shop on a tree
From MaRDI portal
Publication:6134059
DOI10.1007/978-3-031-35305-5_13zbMath1520.90098OpenAlexW4381956460MaRDI QIDQ6134059
Ilya Chernykh, Olga Krivonogova, Anna Shmyrina
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_13
approximation algorithmsrouting open shopoptima localizationunrelated travel timesproportionate open shop
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling ordered open shops
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Efficient algorithms for the routing open shop with unrelated travel times on cacti
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
- Two-machine routing open shop: How long is the optimal makespan?
- How the difference in travel times affects the optima localization for the routing open shop
- Irreducible bin packing and normality in routing open shop
- A cyclical search for the two machine flow shop and open shop to minimise finishing time
- The routing open-shop problem on a network: complexity and approximation
- Some positive news on the proportionate open shop problem
- Routing Open Shop with Unrelated Travel Times
- The 2-Machine Routing Open Shop on a Triangular Transportation Network
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
- Polynomial time approximation algorithms for proportionate open‐shop scheduling
This page was built for publication: Approximation algorithms for two-machine proportionate routing open shop on a tree
