Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics Full article
| Source | Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings Compilation, Springer. 2019. 716 c. ISBN 978-3-030-22628-2. |
||||
|---|---|---|---|---|---|
| Journal |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Output data | Year: 2019, Pages: 342-357 Pages count : 16 DOI: 10.1007/978-3-030-22629-9_24 | ||||
| Tags | Buffer; Flow shop; Heuristic; Lagrangian relaxation; Makespan; Polynomial-time algorithm | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Kononov A.
, Memar J.
, Zinder Y.
Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics
In compilation 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
In compilation 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
Identifiers:
| Scopus: | 2-s2.0-85067654858 |
| OpenAlex: | W2952171133 |