A -approximation algorithm for the two-machine routing open-shop problem on a two-node network
Year of publication: |
2005
|
---|---|
Authors: | Averbakh, Igor ; Berman, Oded ; Chernykh, Ilya |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 166.2005, 1, p. 3-24
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The -machine flowshop problem with unit-time operations and intree precedence constraints
Averbakh, Igor, (2005)
-
The routing open-shop problem on a network: Complexity and approximation
Averbakh, Igor, (2006)
-
The plant location problem with demand-dependent setup costs and centralized allocation
Averbakh, Igor, (1998)
- More ...