last update: 17.11.98 (SK)
http://www.mathematik.uni-osnabrueck.de/research/OR/class
Job-shop problems with preemption
maximal polynomially solvable:
Sotskov (1991) [
5
]
Sotskov (1991) [
5
]
maximal pseudopolynomially solvable:
Middendorf & Timkovsky (1999) [
4
]
Middendorf & Timkovsky (1999) [
4
]
minimal NP-hard:
Brucker et al. (1999B) [
1
]
Lenstra & Rinnooy Kan (1979) [
3
]
Brucker et al. (1999B) [
1
]
Lenstra (-) [
2
]
Bibliography
About this document ...
WWW daemon apache 2009-06-29