Two-machine routing open shop on a tree › Research Explorer

Novosibirsk State University's Research Portal

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1080/10556788.2020.1734802
Final published version

Original language	English
Pages (from-to)	821-841
Number of pages	21
Journal	Optimization Methods and Software
Volume	36
Issue number	4
DOIs	https://doi.org/10.1080/10556788.2020.1734802
Publication status	Published - 2021

Research areas

instance reduction, open shop with delays, overloaded edge, overloaded node, polynomially solvable subclass, routing open shop, Scheduling, standard lower bound, ALGORITHM, SCHEDULING PROBLEMS, FLOWSHOP, JOBS, COMPLEXITY

OECD FOS+WOS

ID: 23803834