Brucker et al. (1977) [3] | |
Hu (1961) [18], Davida & Linton (1976) [10] | |
Assignment-problem | |
Brucker et al. (1999) [5] | |
Dror et al. (1998) [12], Baptiste et al. (2004) [1] | |
Brucker et al. (1977) [3], Monma (1982) [25] | |
Garey & Johnson (1976) [14] | |
Garey & Johnson (1977) [15] | |
Brucker et al. (2002) [4], Huo & Leung (2005) [19] | |
Hu (1961) [18] | |
Baptiste & Timkovsky (2004) [2] | |
Coffman & Graham (1972) [9] | |
Baptiste et al. (2004) [1] | |
Dessouky et al. (1990) [11] | |
Horn (1973) [17], Bruno et al. (1974) [8] | |
Brucker & Kravchenko (2008) [7] | |
Networkflowproblem | |
Baptiste et al. (2004) [1] | |
Assignment-problem | |
Brucker & Kravchenko (2005) [6] | |
Networkflowproblem | |
Assignment-problem |
Lawler et al. (1989) [21] | |
Lawler et al. (1989) [21] | |
Lawler et al. (1989) [21] |
Lenstra et al. (1977) [24] | ||
Garey & Johnson (1978) [16] | ||
Brucker et al. (1977) [3] | ||
Ullman (1975) [27] | ||
Du et al. (1991) [13] | ||
Kubiak (1988) [20] | ||
Brucker et al. (1977) [3] | ||
Lenstra (-) [22] | ||
Lenstra & Rinnooy Kan (1978) [23] | ||
Du et al. (1991) [13] | ||
Single-machine problem | ||
Bruno et al. (1974) [8] | ||
Lenstra (-) [22] | ||
Timkovsky (2003) [26] | ||
Single-machine problem | ||
Single-machine problem |