haku: @indexterm Scheduling / yhteensä: 635
viitteet: 380-389 / 635
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
380.
An application of the bin-packing technique to job scheduling on uniform processors
Journal of the Operational Research Society
1991 : FEB, VOL. 42:2, p. 169-172
 1991 Vel, H. van de
Shijie, S.
381.
Constructing school timetables using simulated annealing : sequential and parallel algorithms.
Management Science
1991 : JAN, VOL. 37:1, p. 98-113
 1991 Abramson, D.
382.
Optimal sequencing and resource allocation in research and development projects.
Management Science
1991 : FEB, VOL. 37:2, p. 140-157
 1991 Granot, D.
Zuckerman, D.
383.
Testing feasibility in a lot scheduling problem
Operations Research
1990 : NOV-DEC, VOL. 38:2, p. 1079-1088
 1990 Anderson, E. J.
384.
A heuristic solution procedure to minimize makespan on a single machine with non-linear cost functions
Journal of the Operational Research Society
1990 : NOV, VOL. 41:11, p. 1065-1068
 1990 Alidaee, B.
385.
A two-level production control model with target amount rescheduling
Journal of the Operational Research Society
1990 : NOV, VOL. 41:11, p. 1021-1028
 1990 Golenko-Ginzburg, D.
386.
Scheduling interviews for a job fair.
Operations Research
1990 : NOV-DEC, VOL. 38:6, p. 951-960
 1990 Bartholdi, J. J.
McCroan, K. L.
387.
Scheduling networks of queues : heavy traffic analysis of a two-station network with controllable inputs.
Operations Research
1990 : NOV-DEC, VOL. 38:6, p. 1065-1078
 1990 Wein, L. M.
388.
Scheduling networks of queues: heavy traffic analysis of a two-station closed network.
Operations Research
1990 : NOV-DEC, VOL. 38:6, p. 1052-1064
 1990 Harrison, J. M.
Wein, L. M.
389.
Optimal and heuristic models for lot splitting in a flow shop
Decision Sciences
1990 : FALL, VOL. 21:4, p.691-709
 1990 Kropp, D.H.
Smunt, T.L.
« edellinen sivu | seuraava sivu »
SCIMA