Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree

DOI10.1007/978-3-030-10934-9_7zbMath1464.90026OpenAlexW2910405850MaRDI QIDQ2026152

Ilya Chernykh

Publication date: 18 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-10934-9_7

zbMATH Keywords

schedulingpreemptionrouting open shopoverloaded edgeoverloaded nodepolynomially solvable subclass

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Irreducible bin packing and normality in routing open shop ⋮ Germ order for one-dimensional packings

This page was built for publication: Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree