How the difference in travel times affects the optima localization for the routing open shop

DOI10.1007/978-3-030-22629-9_14zbMath1439.90032OpenAlexW2953148762MaRDI QIDQ2181758

Ekaterina Lgotina, Ilya Chernykh

Publication date: 19 May 2020

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

zbMATH Keywords

schedulingapproximation algorithmrouting open shopoptima localizationunrelated travel times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ 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

This page was built for publication: How the difference in travel times affects the optima localization for the routing open shop