Two-Machine Routing Open Shop: How Long Is the Optimal Makespan? › Research Explorer

Novosibirsk State University's Research Portal

Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?

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-77876-7_17
Final published version

Ilya Chernykh

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Proceedings
Editors	Panos Pardalos, Michael Khachay, Alexander Kazakov
Publisher	Springer
Pages	253-266
Number of pages	14
ISBN (Print)	9783030778750
DOIs	https://doi.org/10.1007/978-3-030-77876-7_17
Publication status	Published - 2021
Event	20th International Conference on Mathematical Optimization Theory and Operations Research - Irkutsk, Russian Federation Duration: 5 Jul 2021 → 10 Jul 2021 Conference number: 20

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12755 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on Mathematical Optimization Theory and Operations Research
Abbreviated title	MOTOR 2021
Country/Territory	Russian Federation
City	Irkutsk
Period	05.07.2021 → 10.07.2021

Research areas

Efficient algorithm, Instance reduction, Optima localization, Routing open shop, Standard lower bound

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES

ID: 34146618