Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines Научная публикация
| Конференция |
18th International conference on mathematical optimization theory and operations research 08-12 июл. 2019 , Екатеринбург |
||||
|---|---|---|---|---|---|
| Журнал |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Вых. Данные | Год: 2019, Страницы: 264-276 Страниц : 13 DOI: 10.1007/978-3-030-22629-9_19 | ||||
| Ключевые слова | Complexity; Makespan bounds; Polynomial time; Routing Open Shop; Scheduling; Unit processing times | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Golovachev M.
, Pyatkin A.V.
Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines
Lecture Notes in Computer Science. 2019. P.264-276. DOI: 10.1007/978-3-030-22629-9_19 Scopus OpenAlex
Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines
Lecture Notes in Computer Science. 2019. P.264-276. DOI: 10.1007/978-3-030-22629-9_19 Scopus OpenAlex
Идентификаторы БД:
| Scopus: | 2-s2.0-85067656044 |
| OpenAlex: | W2949409904 |