On a Routing Open Shop Problem on Two Nodes with Unit Processing Times

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

Original language	English
Pages (from-to)	470-479
Number of pages	10
Journal	Journal of Applied and Industrial Mathematics
Volume	14
Issue number	3
DOIs	https://doi.org/10.1134/S1990478920030060
Publication status	Published - 1 Aug 2020

complexity, makespan bound, polynomial time, routing open shop problem, scheduling, unit processing time

ID: 25993516