Technical Notes - Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
| Year of publication: |
2001
|
|---|---|
| Authors: | Espinouse, M.-L. ; Formanowicz, P. ; Penz, B. |
| Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 7160331. - Vol. 52.2001, 1, p. 116-121
|
Saved in:
Saved in favorites
Similar items by person
-
Minimizing the Makespan in the Two-Machine No-Wait Flow-Shop with Limited Machine Availability
Espinouse, M.L., (1999)
-
Tabu search for DNA sequencing with false negatives and false positives
Blazewicz, J., (2000)
-
Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
Aubry, A., (2008)
- More ...