Citation: L. Klukowski, The nearest adjoining order method for pairwise comparisons in the form ofdifference of ranks, ANN OPER R, 97, 2000, pp. 357-378
Citation: Tce. Cheng et A. Janiak, A permutation flow-shop scheduling problem with convex models of operationprocessing times, ANN OPER R, 96, 2000, pp. 39-60
Authors:
Gascon, V
Villeneuve, S
Michelon, P
Ferland, JA
Citation: V. Gascon et al., Scheduling the flying squad nurses of a hospital using a multi-objective programming model, ANN OPER R, 96, 2000, pp. 149-166
Citation: V. Marianov et M. Rios, A probabilistic quality of service constraint for a location model of switches in ATM communications networks, ANN OPER R, 96, 2000, pp. 237-243
Citation: C. Privault et G. Finke, k-server problems with bulk requests: an application to tool switching in manufacturing, ANN OPER R, 96, 2000, pp. 255-269