Author and Title Index
- PDF / 156,561 Bytes
- 7 Pages / 595 x 794 pts Page_size
- 55 Downloads / 206 Views
#2002 Operational Research Society Ltd. All rights reserved. 0160-5682/02 $15.00 www.palgrave-journals.com/jors
INDEX TO VOLUME 53, 2002 AUTHOR AND TITLE INDEX (Excluding Book Selection and Viewpoints) * ¼ Case-Oriented Paper
Abdullah, A.: (see Osman, I. H.) Abillama, W. R.: (see Zouein, P. P.) Adekola, O. A.: A generalised life-expectancy model for a population, 919 Adler, N. and Golany, B.: Including principal component weights to improve discrimination in data envelopment analysis, 985 Aickelin, U.: An indirect genetic algorithm for set covering problems, 1118 Alabas, C., Altiparmak, F. and Dengiz, B.: A comparison of the performance of artificial intelligence techniques for optimizing the number of kanbans, 907 Aldowaisan, T.: (see Allahverdi, A.) Alidaee, B.: (see Naidu, J. T.) Allahverdi, A. and Aldowaisan, T.: No-wait flowshops with bicriteria of makespan and total completion time, 1004 Alonso, S.: (see Colebrook, M.) Altiparmak, F.: (see Alabas, C.) Anderson, E. J.: Markov chain modelling of the solution surface in local search, 630 Andre´s, C.: (see Pastor, R.) *Angelelli, E. and Speranza, M. G.: The application of a vehicle routing model to a waste-collection problem: two case studies, 944 Annabi, H.: (see Garcı´a-Murillo, M.) *Annetts, J. E. and Audsley, E.: Multiple objective linear programming for environmental farm planning, 933 *Antipov, A. and Meade, N.: Forecasting call frequency at a financial services call centre, 953 Appa, G.: On the uniqueness of solutions to linear programs, 1127 *Arenas, M., Bilbao, A., Caballero, R., Go´mez, T., Rodrı´guez, M. V. and Ruiz, F.: Analysis via goal programming of the minimum achievable stay in surgical waiting lists, 387 Arns, M., Fischer, M., Kemper, P. and Tepper, C.: Supply chain modelling and its analytical evaluation, 885 Audsley, E.: (see Annetts, J. E.)
Bachman, A., Cheng, T. C. E., Janiak, A. and Ng, C. T.: Scheduling start time dependent jobs to minimize the total weighted completion time, 688 Bailey, P.: (see Neighbour, M. R.) *Baker, K. R. and Powell, S. G.: Methods for assigning students to groups: a study of alternative objective functions, 397 Banjevic, D.: (see Vlok, P. J.) *Beasley, J. E., Howells, H. and Sonander, J.: Improving short-term conflict alert via tabu search, 593 Beling, P. A.: (see Zhu, H.) Bell, H.: (see Cherrett, T.) Belobaba, P. P.: (see Weatherford, L. R.) Bennell, J. A., Potts, C. N. and Whitehead, J. D.: Local search algorithms for the min-max loop layout problem, 1109 *Bertomeu, M. and Romero, C.: Forest management optimisation models and habitat diversity: a goal programming approach, 1175 Bilbao, A.: (see Arenas, M.) Billaut, J.-C.: (see Lorigeon, T.) Bouquard, J.-L.: (see Lorigeon, T.) *Bowers, J. and Mould, G.: Concentration and the variability of orthopaedic demand, 203 Brignall, S.: (see Johnston, R.) Brooks, M.: (see Yeo, A. C.) Brooks, R. J.: (see Robinson, S.) Bruno, G. and Laporte, G.: A simple enhancement of the Esau—Williams heuristic for the capacitated minimum spanning tree problem, 583 *Butler, M. and Williams,
Data Loading...
