Routing Open Shop with Unrelated Travel Times

DOI10.1007/978-3-319-44914-2_22zbMath1385.90007OpenAlexW2559086096MaRDI QIDQ3133221

Ilya Chernykh

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_22

zbMATH Keywords

schedulingrouting open shopunrelated travel times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ 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 Unrelated Travel Times