Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree › Research Explorer

Novosibirsk State University's Research Portal

Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-030-10934-9_7
Final published version

Ilya Chernykh

Original language	English
Title of host publication	Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers
Editors	Yury Kochetov, Michael Khachay, Yury Evtushenko, Vlasta Malkova, Mikhail Posypkin, Milojica Jacimovic
Publisher	Springer-Verlag GmbH and Co. KG
Pages	97-110
Number of pages	14
ISBN (Print)	9783030109332
DOIs	https://doi.org/10.1007/978-3-030-10934-9_7
Publication status	Published - 1 Jan 2019
Event	9th International Conference on Optimization and Applications, OPTIMA 2018 - Petrovac, Montenegro Duration: 1 Oct 2018 → 5 Oct 2018

Publication series

Name	Communications in Computer and Information Science
Volume	974
ISSN (Print)	1865-0929

Conference

Conference	9th International Conference on Optimization and Applications, OPTIMA 2018
Country/Territory	Montenegro
City	Petrovac
Period	01.10.2018 → 05.10.2018

Research areas

Overloaded edge, Overloaded node, Polynomially solvable subclass, Preemption, Routing open shop, Scheduling

ID: 18503917