haku: @indexterm assignment problem / yhteensä: 21
viitteet: 4-13 / 21
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
4.
Assigning telephone operators to shifts at new Brunswick telephone company
Interfaces
1997 : JUL-AUG, VOL. 27:4, p. 1-11
 1997 Thompson, G.
5.
A genetic algorithm for the generalised assignment problem
Journal of the Operational Research Society
1997 : AUG, VOL. 48:8, p. 804-809
 1997 Wilson, J.M.
6.
Ants can colour graphs
Journal of the Operational Research Society
1997 : MAR, VOL. 48:3, p. 295-305
 1997 Costa, D.
Hertz, A.
7.
Relaxation heuristics for a generalized assignment problem
European Journal of Operational Research
1996 : JUN 21, VOL. 91:3, p. 600-610
 1996 Lorena, L.
Narciso,
8.
A graph colouring model for assigning a heterogeneous workforce to a given schedule.
European Journal of Operational Research
1996 : APR 19, VOL. 90:2, p. 285-302
 1996 Valls, V.
Perez, A.
Quintanilla, S.
9.
A heuristic procedure for the single-row facility layout problem
European Journal of Operational Research
1995 : NOV 16, VOL. 87:1, p. 65-73
 1995 Kumar, K.
Hadjinicola, G.
Lin, T.
10.
A min cost flow solution for dynamic assignment problems in networks with storage devices
Management Science
1995 : JAN, VOL. 41:1, p. 83-93
 1995 Grossmann, W.
11.
Linking management selection and development through stretch assignments
Human Resource Management
1995 : SPRING, VOL. 34:1, p. 93-115
 1995 McCauley, C.
Eastman, L.
Ohlott, P.
12.
Single-shift off-day scheduling of a hierarchical workforce with variable demands
European Journal of Operational Research
1994 : OCT 13, VOL. 78:1, p. 49-57
 1994 Hung, R.
13.
A constructive method to improve lower bounds for a class of quadratic assignment problems
Operations Research
1994 : SEP-OCT, VOL. 42:5, p. 837-845
 1994 Chakrapani, J.
Skorin-Kapov, J.
« edellinen sivu | seuraava sivu »
SCIMA