Table Of Content

LSEVIE Operations Research Letters 21 (1997) 253-254 Author Index to Volume 21 The issue number is given in front of the page numbers Bertsimas, D. and C. Teo, The parsimonious property of cut covering problems and its applications (3) 123-132 Birge, J.R. and K.D. Glazebrook, Bounds on optimal values in stochastic scheduling (3) 107-114 Broughan, K., see Zhu, N. (1) 31- 37 Burlet, M. and O. Goldschmidt, A new and improved algorithm for the 3-cut problem (5) 225-227 Chen, Y.-M., see Doi, M. (5) 249-252 Chen, B. and A.P.A. Vestjens, Scheduling on identical machines: How good is LPT in an on-line setting? (4) 165-169 Chen, J. and G. Steiner, Approximation methods for discrete lot streaming in flow shops (3) 139-145 Chen, F. and Y.-S. Zheng, Sensitivity analysis of an (s, S) inventory model (1) 19-— 23 Chen, Z.-L., Q. Lu and G. Tang, Single machine scheduling with discretely controllable processing times (2) 69— 76 Doi, M., Y.-M. Chen and H. Osawa, A queueing model in which arrival times are scheduled (5) 249-252 Erratum (4) 210 Ewerhart, C., Bayesian optimization and genericity (5) 243-248 Frey, A. and Y. Takahashi, A note on an M/GI/1/N queue with vacation time and exhaustive service discipline (2) 95-100 Ghosh, J.B. and J.N.D. Gupta, Batch scheduling to minimize maximum lateness (2) 77- 80 Glazebrook, K.D., see Birge, J.R. (3) 107-114 Goldschmidt, O., see Burlet, M. (5) 225-227 Gouweleeuw, F.N., The loss probability in an overloaded queue using the dual queue (2) 101-106 Greenberg, I., Markov chain approximation methods in a class of level-crossing problems (3) 153-158 Griffith, W.S., A note on the characterization of the Barlow and Wu continuum structure functions (2) 65— 67 Gupta, J.N.D., see Ghosh, J.B. (2) 77- 80 Hall, L.A., see Strusevich, V.A. (1) 11- 18 Haouari, M. and R. M’Hallah, Heuristic algorithms for the two-stage hybrid flowshop problem (1) 43-— $3 Hasenbein, J.J., Necessary conditions for global stability of multiclass queueing networks (2) 87-— 94 Hassin, R., S. Rubinstein and A. Tamir, Approximation algorithms for maximum disper- sion (3) 133-137 Héche, J.-F. and T.M. Liebling, Finding minimum area simple pentagons (5) 229-233 Hsu, V.N., T.J. Lowe and A. Tamir, Structured p-facility location problems on the line solvable in polynomial time (4) 159-164 Jansen, B., see Warners, J.P. (2) Kats, V. and E. Levner, A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling (4) Kellerer, H., V. Kotov, M.G. Speranza and Z. Tuza, Semi on-line algorithms for the partition problem (5) 2 Kotov, V., see Kellerer, H. (5) 2 Elsevier Science B.V. Author Index to Volume 2] Levner, E., see Kats, V. Liebling, T.M., see Héche, J.-F. Lowe, T.J., see Hsu, V.N. Lu, Q., see Chen, Z.-L. M’Hallah, R., see Haouari, M. Miyazawa, M., see van Dijk, N.M. Nakade, K., K. Ohno and J.G. Shanthikumar, Bounds and approximations for cycle times of a U-shaped production line Nazareth, J.L., Deriving potential functions via a symmetry principle for nonlinear equations Nutov, Z. and M. Penn, Faster approximation algorithms for weighted triconnectivity augmentation problems Ohno, K., see Nakade, K. Osawa, H., see Doi, M. Penn, M., see Nutov, Z. Posner, M.J.M., see Wu, P. Roos, C., see Warners, J.P. Rubinstein, S., see Hassin, R. Shanthikumar, J.G., see Nakade, K. Sherali, H.D. and C.H. Tuncbilek, New reformulation linearization/convexification re- laxations for univariate and multivariate polynomial programming problems Speranza, M.G., see Kellerer, H. Stein, C. and J. Wein, On the existence of schedules that are near-optimal for both makespan and total weighted completion time Steiner, G., see Chen, J. Strusevich, V.A. and L.A. Hall, An open shop scheduling problem with a non-bottleneck machine Szkatula, K., The growth of multi-constraint random knapsacks with large right-hand sides of the constraints Takahashi, Y., see Frey, A. Tamir, A., see Hsu, V.N. Tamir, A., see Hassin, R. Tang, G., see Chen, Z.-L. Teo, C., see Bertsimas, D. Terlaky, T., see Warners, J.P. Tuncbilek, C.H., see Sherali, H.D. Tuza, Z., see Kellerer, H. van Dijk, N.N. and M. Miyazawa, Error bounds on a practical approximation for finite tandem queues Vestjens, A.P.A., see Chen, B. Warners, J.P., T. Terlaky, C. Roos and B. Jansen, Potential reduction algorithms for structured combinatorial optimization problems Wein, J., see Stein, C. Wood, D.R., An algorithm for finding a maximum clique in a graph Wu, P. and M.J.M. Posner, A level-crossing approach to the solution of the shortest- queue problem Xie, J., Polynomial algorithms for single machine scheduling problems with financial constraints Zaporozhets, A., A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems Zheng, Y.-S., see Chen, F. Zhu, N. and K. Broughan, On dominated terms in the general knapsack problem