The complexity of the problem of minimizing makespan for identical jobs Conference Abstracts
| Conference |
22-я Международная конференция «Математическая теория оптимизации и исследование операций» 02-08 Jul 2023 , Екатеринбург |
||
|---|---|---|---|
| Source | XXII International Conference Mathematical Optimization Theory
and Operations Research (MOTOR 2023). Ekaterinburg, Russia
July 2–8, 2023, Abstracts Compilation, Екатеринбург.2023. 121 c. |
||
| Output data | Year: 2023, Pages: 52 Pages count : 1 | ||
| Authors |
|
||
| Affiliations |
|
Cite:
Servakh V.
The complexity of the problem of minimizing makespan for identical jobs
In compilation XXII International Conference Mathematical Optimization Theory and Operations Research (MOTOR 2023). Ekaterinburg, Russia July 2–8, 2023, Abstracts. 2023. – C.52.
The complexity of the problem of minimizing makespan for identical jobs
In compilation XXII International Conference Mathematical Optimization Theory and Operations Research (MOTOR 2023). Ekaterinburg, Russia July 2–8, 2023, Abstracts. 2023. – C.52.
Identifiers:
No identifiers
Citing:
Пока нет цитирований