Routing open shop with two nodes, unit processing times and equal number of jobs and machines

DOI10.1007/978-3-030-22629-9_19zbMath1439.90033OpenAlexW2949409904MaRDI QIDQ2181765

Artem V. Pyatkin, Mikhail Golovachev

Publication date: 19 May 2020

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

zbMATH Keywords

complexityschedulingpolynomial timeunit processing timesrouting open shopmakespan bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

This page was built for publication: Routing open shop with two nodes, unit processing times and equal number of jobs and machines