Table Of Content

Operations Research Letters 14 (1993) 297-298 December 1993 North-Holland Author Index to Volume 14 (1993) The issue number is given in front of the page numbers Amado, L. and P. Barcia, Matroidal relaxations for 0—1 knapsack problems (3) 147-152 Armstrong, R., see Lei, L. (2) 91- 98 Atkins, D. and S. De, A performance bound on single cycle lot-sizing policies for an assembly system with stochastic demand (5) 265-273 Avramidis, A.N. and J.R. Wilson, A splitting scheme for control variates (4) 187-198 Badrinath, V., see Mazumdar, R. (1) 19- 24 Barcia, P., see Amado, L. (3) 147-152 Brucker, P., B. Jurisch, T. Tautenhahn and F. Werner, Scheduling unit time open shops to minimize the weighted number of late jobs (S) 245-250 Carrizosa, E., E. Conde, F.R. Fernandez and J. Puerto, Efficiency in Euclidean constrained location problems (5) 291-295 Chao, X., see Chen, H. (4) 199-206 Charnes, A. and M. Kress, Two simple applications of the unimodularity property (5) 257-260 Charon, I. and O. Hudry, The noising method: a new method for combinatorial optimization (3) 133-137 Chen, B., A note on LPT scheduling (3) 139-142 Chen, H., P. Yang, D.D. Yao and X. Chao, Optimal control of a simple assembly system (4) 199-206 Cheng, D.W., Concavity of system throughput and information transfer in a PAC system (3) 143-146 Conde, E., see Carrizosa, E. (5) 291-295 Contaldi, G., G. Di Pillo and S. Lucidi, A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (3) 153-161 Cregger, M.L., see Vasko, F.J. (5) 275-282 Dan, N.D., see Tuy, H. (2) 99-109 De, S., see Atkins, D. (S) 265-273 Di Pillo, G., see Contaldi, G. (3) 153-161 El-Taha, M., see Stidham Jr., S. (1) 1- 7 Fernandez, F.R., see Carrizosa, E. (S) 291-295 Friedman, E.J. and A.S. Landsberg, Short run dynamics of multi-class queues (4) 221-229 Ghannadan, S., see Tuy, H. (2) 99-109 Gu, S., see Lei, L. (2) 91- 98 Guillemin, F., see Mazumdar, R. (1) 19- 24 Hlynka, M. and T. Wang, Comments on duality of queues with finite buffer size (1) 29- 33 Hudry, O., see Charon, I. (3) 133-137 Imielinska, C., B. Kalantari and L. Khachiyan, A greedy heuristic for a minimum-weight forest problem (2) 65- 71 Jaillet, P., Rate of convergence for the Euclidean minimum spanning tree limit law (2) 73- 78 Joglekar, P. and P. Lee, An exact formulation of inventory costs and optimal lot size in face of sudden obsolescence (5) 283-290 Jurisch, B., see Brucker, P. (5) 245-250 Kalantari, B. and L. Khachiyan, On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (5) 237-244 Kalantari, B., see Imielifska, C. (2) 65- 71 Khachiyan, L., see Imielinska, C. (2) 65- 71 Khachiyan, L., see Kalantari, B. (5) 237-244 Kim, S. and B.-s. Um, An improved subgradient method for constrained nondifferen- tiable optimization (1) 61- 64 Kress, M., see Charnes, A. (5) 257-260 0167-/6933 /7$067.0 0 © 1993, Elsevier Science Publishers B.V. All rights reserved Volume 14, Number 5 OPERATIONS RESEARCH LETTERS December 1993 Kubiak, W., Completion time variance minimization on a single machine is difficult (1) 49- 59 Lai, T.-C., Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (4) 215-220 Landsberg, A.S., see Friedman, E.J. (4) 221-229 Lazarus, A.J., Certain expected values in the random assignment problem (4) 207-214 Lee, I.-J. and E. Roth, A heuristic for the transient expected queue length of Markovian Queueing Systems (1) 25- 27 Lee, P., see Joglekar, P. (5) 283-290 Lei, L., R. Armstrong and S. Gu, Minimizing the fleet size with dependent time-window and single-track constraints (2) 91- 98 Lucidi, S., see Contaldi, G. (3) 153-161 Marcotte, P., see Zhu, D.L. (2) 111-120 Mazumdar, R., V. Badrinath, F. Guillemin and C. Rosenberg, A note on the pathwise version of Little’s formula (1) 19- 24 McCormick, S.T., Approximate binary search algorithms for mean cuts and cycles (3) 129-132 Miyazawa, M. and G. Yamazaki, Note on batch arrival LCFS and related symmetric queues (1) 35- 41 Newhart, D.D., see Vasko, F.J. (5) 275-282 Nguyen, V. and M.I. Reiman, Variance reduction for sensitivity estimates obtained from regenerative simulation (1) 9 18 Orlin, J.B. and C. Stein, Parallel algorithms for the assignment and minimum-cost flow problems (4) 181-186 Ovacik, 1.M. and R. Uzsoy, Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (5) 251-256 Preater, J., The senior and junior secretaries problem (4) 231-235 Puerto, J., see Carrizosa, E. (5) 291-295 Punnen, A.P., Erratum on: “Travelling salesman problem under categorization” (Operations Research Letters 12 (1992) 89-95) (2) 121 Ralphs, T.K., On the mixed Chinese postman problem (3) 123-127 Rege, K., On the M/G/1 queue with Bernoulli feedback (3) 163-170 Reiman, M.I., see Nguyen, V. (1) 9 18 Rosenberg, C., see Mazumdar, R. (1) 19- 24 Rosenberg, E. and U. Yechiali, The M*/G/1 queue with single and multiple vacations under the LIFO service regime (3) 171-179 Roth, E., see Lee, I.-J. (1) 25- 27 Stein, C., see Orlin, J.B. (4) 181-186 Stidham Jr., S. and M. El-Taha, A note on sample-path stability conditions for input—output processes (i) 1- 7 Stott, K.L., see Vasko, F.J. (5) 275-282 Szwarc, W., An instant solution of the 2 x n Bottleneck transportation problem (S) 261-264 Tamir, A., Complexity results for the p-median problem with mutual communication (2) 79- 84 TautenhaTh.n, ,se e Brucker, P. (S) 245-250 Tuy, H., N.D. Dan and S. Ghannadan, Strongly polynomial time algorithms for certain concave minimization problems on networks (2) 99-109 Um, B.-s., see Kim, S. (1) 61- 64 Uzsoy, R., see Ovacik, I.M. (5) 251-256 Vasko, F.J., M.L. Cregger, D.D. Newhart and K.L. Stott, A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (S) 275-282 Viswanathan, S., Optimal policies for the capacitated two stage multi-item inventory model with joint setup costs (1) 43- 48 WangT.,, s ee Hlynka,M . (1) 29- 33 Webster, S.T., Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (2) 85- 90 WerneFr.,, s ee Brucker, P. (5) 245-250 Wilson, J.R., see Avramidis, A.N. (4) 187-198 Yamazaki, G., see Miyazawa, M. (1) 35- 41 YangP.,, s ee Chen, H. (4) 199-206 Yao, D.D., see Chen, H. (4) 199-206 Yechiali, U., see Rosenberg, E. (3) 171-179 Zhu, D.L. and P. Marcotte, Modified descent methods for solving the monotone variational inequality problem (2) 111-120