Efficient algorithms for the routing open shop with unrelated travel times on cacti

DOI10.1007/978-3-030-38603-0_1zbMath1473.90013OpenAlexW2999460437MaRDI QIDQ1982880

Olga Krivonogova, Ilya Chernykh

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_1

zbMATH Keywords

instance reductionrouting open shopoptima localizationpolynomially solvable subcaseunrelated travel times

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ Irreducible bin packing and normality in routing open shop ⋮ Two-machine routing open shop: How long is the optimal makespan?

This page was built for publication: Efficient algorithms for the routing open shop with unrelated travel times on cacti