Two-machine routing open shop: How long is the optimal makespan?

DOI10.1007/978-3-030-77876-7_17zbMath1485.90039OpenAlexW3173048457MaRDI QIDQ2117636

Ilya Chernykh

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_17

zbMATH Keywords

efficient algorithminstance reductionrouting open shopoptima localizationstandard lower bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient approximation algorithms for the routing open shop problem
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• 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
• The routing open-shop problem on a network: complexity and approximation
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• On the optima localization for the three-machine routing open shop
• Optimal two- and three-stage production schedules with setup times included
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• Open Shop Scheduling to Minimize Finish Time
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

This page was built for publication: Two-machine routing open shop: How long is the optimal makespan?