Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
Year of publication: |
2006
|
---|---|
Authors: | Sedeño-Noda, A. ; Alcaide, D. ; González-Martin, C. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 174.2006, 3, p. 1501-1518
|
Saved in:
Saved in favorites
Similar items by person
-
An O(nm log(U-n)) Time Maximum Flow Algorithm
Sedeño-Noda, A., (2000)
-
The biobjective minimum cost flow problem
Sedeño-Noda, A., (2000)
-
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
Alcaide, D., (2002)
- More ...