haku: @indexterm Scheduling / yhteensä: 635
viitteet: 304-313 / 635
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
304.
When is the classroom assignment problem hard?
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S28-S39
 1992 Carter, M.W.
Tovey, C.A.
305.
An improved formulation for the job-shop scheduling problem
Journal of the Operational Research Society
1992 : NOV, VOL. 43:11, p. 1047-1054
 1992 Liao, C.-J.
You, C.-T.
306.
Minimizing total cost in scheduling outpatient appointments
Management Science
1992 : DEC, VOL. 38:12, p. 1750-1764
 1992 Ho, C-J.
Lau, H-S.
307.
Restricted neighborhood in the tabu search for the flowshop problem
European Journal of Operational Research
1992 : OCT 9, VOL. 62:1 p.27-36
 1992 Adenso-Diaz, B.
308.
Minimizing job idleness in deadline constrained environments
Operations Research
1992 : SEP-OCT, VOL. 40:5, p. 972-985
 1992 Ahmadi, R.H.
Bagchi, U.
309.
Customer service in pull production systems
Operations Research
1992 : SEP-OCT, VOL. 40:5, p. 948-958
 1992 Spearman, M.L.
310.
Optimality of myopic policies in disposing excess inventory
Operations Research
1992 : JUL-AUG, VOL. 40:4, p. 800-803
 1992 Rosenfield, D.B.
311.
Programme management and its information systems reqirements
International Journal of Project Management
1992 : NOV, VOL. 10:4, pp. 196-206
 1992 Turner, J.
Speiser, A.
312.
Two-stage flowshop scheduling problem with bicriteria
Journal of the Operational Research Society
1992 : SEP, VOL. 43:9, p. 871-884
 1992 Rajendran, C.
313.
An exact solution algorithm for a class of production planning and scheduling problems
Journal of the Operational Research Society
1992 : OCT, VOL. 43:10, p. 961-970
 1992 Madan. M.S.,
Gilbert, K.C.
« edellinen sivu | seuraava sivu »
SCIMA