A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
Year of publication: |
2009
|
---|---|
Authors: | Sedeño-Noda, A. ; de Pablo, D.Alcaide López ; González-Martín, C. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 196.2009, 1, p. 140-154
|
Saved in:
Saved in favorites
Similar items by person
-
New efficient shortest path simplex algorithm : pseudo permanent labels instead of permanent labels
Sedeño-Noda, A., (2009)
-
Sedeño-Noda, A., (2009)
-
Preemptive benchmarking problem: An approach for official statistics in small areas
Sedeño-Noda, A., (2009)
- More ...