Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics Научная публикация
| Сборник | Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings Сборник, Springer. 2019. 716 c. ISBN 978-3-030-22628-2. |
||||
|---|---|---|---|---|---|
| Журнал |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Вых. Данные | Год: 2019, Страницы: 342-357 Страниц : 16 DOI: 10.1007/978-3-030-22629-9_24 | ||||
| Ключевые слова | Buffer; Flow shop; Heuristic; Lagrangian relaxation; Makespan; Polynomial-time algorithm | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Kononov A.
, Memar J.
, Zinder Y.
Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics
В сборнике Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.342-357. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_24 Scopus OpenAlex
Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics
В сборнике Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.342-357. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_24 Scopus OpenAlex
Идентификаторы БД:
| Scopus: | 2-s2.0-85067654858 |
| OpenAlex: | W2952171133 |