Efficient approximation algorithms for the routing open shop problem Full article
| Journal |
Computers and Operations Research
ISSN: 0305-0548 , E-ISSN: 1873-765X |
||||
|---|---|---|---|---|---|
| Output data | Year: 2012, Volume: 40, Number: 3, Pages: 841-847 Pages count : 7 DOI: 10.1016/j.cor.2012.01.006 | ||||
| Tags | Approximation algorithm; Routing open shop; Worst-case analysis | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Chernykh I.
, Kononov A.
, Sevastyanov S.
Efficient approximation algorithms for the routing open shop problem
Computers and Operations Research. 2012. V.40. N3. P.841-847. DOI: 10.1016/j.cor.2012.01.006 WOS Scopus OpenAlex
Efficient approximation algorithms for the routing open shop problem
Computers and Operations Research. 2012. V.40. N3. P.841-847. DOI: 10.1016/j.cor.2012.01.006 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000312420100017 |
| Scopus: | 2-s2.0-84870242227 |
| OpenAlex: | W1979032346 |