haku: @author Patterson, J. H. / yhteensä: 8
viitteet: 1-8 / 8
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
1.
A multiple-tree search procedure for the resource-constrained project scheduling problem.
European Journal of Operational Research
1996 : MAR 22, VOL. 89:3, p. 525-542
 1996 Simpson, W. P. III
Patterson, J. H.
2.
Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems.
European Journal of Operational Research
1990 : NOV 6, VOL. 49:1, p. 68-79
 1990 Patterson, J. H.
3.
A comparison of due date setting, resource assignment, and job pre-emption heuristics for the multiproject scheduling problem
Decision Sciences
1990 : SPRING, VOL. 21:2, p.387-402
 1990 Bock, D. B.
Patterson, J. H.
4.
A comparative evaluation of heuristic line balancing techniques.
Management Science
1986 : APR, VOL. 32:4, p. 430-454
 1986 Talbot, F. B.
Patterson, J. H.
Gehrlein, W. V.
5.
Capital investment decisions under economies of scale in floating costs.
Financial Management
1985 : AUTUMN, VOL. 14:3, p. 61-69
 1985 Howe, K. M.
Patterson, J. H.
6.
A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem.
Management Science
1984 : JUL, VOL. 30:7, p. 854-867
 1984 Patterson, J. H.
7.
An integer programming algorithm with network cuts for solving the assembly line balancing problem.
Management Science
1984 : JAN, VOL. 30:1, p. 85-99
 1984 Talbot, F. B.
Patterson, J. H.
8.
An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems.
Management Science
1978 : 11 JUL VOL.24 p.1163-1174
 1978 Talbot, F. B.
Patterson, J. H.
« edellinen sivu | seuraava sivu »
SCIMA