On the routing open shop problem with two machines on a two-vertex network
From MaRDI portal
Publication:5263766
DOI10.1134/S1990478912030064zbMath1324.90059MaRDI QIDQ5263766
No author found.
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
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 ⋮ 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 ⋮ O(log m)-approximation for the routing open shop problem
