On complexity of two-machine routing propotionate open shop Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||
|---|---|---|---|
| Output data | Year: 2022, Volume: 19, Number: 2, Pages: 528-539 Pages count : 12 DOI: 10.33048/semi.2022.19.044 | ||
| Authors |
|
||
| Affiliations |
|
Funding (3)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
| 2 | Russian Foundation for Basic Research | 20-01-00045 |
| 3 | Russian Foundation for Basic Research | 20-07-00458 |
Cite:
Chernykh I.
, Pyatkin A.
On complexity of two-machine routing propotionate open shop
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N2. P.528-539. DOI: 10.33048/semi.2022.19.044 WOS РИНЦ
On complexity of two-machine routing propotionate open shop
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N2. P.528-539. DOI: 10.33048/semi.2022.19.044 WOS РИНЦ
Dates:
| Submitted: | Apr 21, 2022 |
| Published online: | Aug 25, 2022 |
Identifiers:
| Web of science: | WOS:000886649600010 |
| Elibrary: | 50336830 |
Citing:
| DB | Citing |
|---|---|
| Elibrary | 1 |