The 2-Machine Routing Open Shop on a Triangular Transportation Network

DOI10.1007/978-3-319-44914-2_23zbMath1385.90008OpenAlexW2558933726MaRDI QIDQ3133222

Ilya Chernykh, Ekaterina Lgotina

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_23

zbMATH Keywords

schedulingrouting open shopoptima localization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ 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 ⋮ Two-machine routing open shop: How long is the optimal makespan?

This page was built for publication: The 2-Machine Routing Open Shop on a Triangular Transportation Network