On the two-machine routing open shop on a tree with preemption allowed

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

Original language	English
Pages (from-to)	548-561
Number of pages	14
Journal	Siberian Electronic Mathematical Reports
Volume	19
Issue number	2
DOIs	https://doi.org/10.33048/semi.2022.19.046
Publication status	Published - 2022

Asymmetric transportation network, Individual travel times, Polynomially solvable cases, Restricted preemption, Routing open shop, Shop scheduling, Standard lower bound

ID: 37515234