Brucker et al. (2002B) [2] | |
Bruno et al. (1974) [5] | |
Hall et al. (2000) [7] | |
Brucker et al. (2002B) [2] | |
Hall et al. (2000) [7] | |
Brucker et al. (2002B) [2] | |
Brucker & Kravchenko (2008) [4] | |
Hall et al. (2000) [7] | |
Brucker et al. (2002B) [2] | |
Baptiste et al. (2004) [1] | |
Assignment problem | |
Brucker et al. (2002B) [2] | |
Brucker & Kravchenko (2005) [3] | |
Networkflowproblem | |
Assignment problem | |
Assignment problem |
Hall et al. (2000) [7], Kravchenko & Werner (1997) [8] | |
Lawler et al. (1989) [9] | |
Lawler et al. (1989) [9] | |
Single-machine problem, Hall et al. (2000) [7] | |
Lawler et al. (1989) [9] | |
Single-machine problem, Hall et al. (2000) [7] |
Lenstra et al. (1977) [11] | ||
Brucker et al. (2002B) [2] | ||
Garey & Johnson (1978) [6] | ||
Hall et al. (2000) [7] | ||
Single-machine problem, Brucker et al. (2002B) [2] | ||
Hall et al. (2000) [7] | ||
Brucker et al. (2002B) [2] | ||
Single-machine problem | ||
Single-machine problem, Brucker et al. (2002B) [2] | ||
Hall et al. (2000) [7] | ||
Brucker et al. (2002B) [2] | ||
Bruno et al. (1974) [5] | ||
Lenstra (-) [10] | ||
Single-machine problem, Hall et al. (2000) [7] | ||
Single-machine problem, Hall et al. (2000) [7] | ||
Single-machine problem, Hall et al. (2000) [7] |