last update: 23.09.99 (SK)
http://www.mathematik.uni-osnabrueck.de/research/OR/class
Flow-shop problems with nowait
maximal polynomially solvable:
Gilmore & Gomory (1964) [
1
], Reddi & Ramamoorthy (1972) [
2
]
minimal NP-hard:
Roeck (1984) [
3
]
Roeck (1984A) [
4
]
Roeck (1984) [
3
]
Roeck (1984) [
3
]
minimal open:
maximal open:
Bibliography
About this document ...
WWW daemon apache 2009-06-29