Operations Research Letters, Volume 29

Volume 29, Number 1, August 2001

András Prékopa:
On the concavity of multivariate probability distribution functions. 1-4
George J. Kyparisis, Christos Koulamas:
A note on weighted completion time minimization in a flexible flow shop. 5-11
Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger:
A polynomially solvable special case of the unbounded knapsack problem. 13-16
Gaurav Singh:
Performance of critical path type algorithms for scheduling on parallel processors. 17-30
Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
The robust spanning tree problem with interval data. 31-40
Feng Zhang, Guochun Tang, Zhi-Long Chen:
A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times. 41-47

Ismael R. de Farias Jr., George L. Nemhauser:
A family of inequalities for the generalized assignment polytope. 49-55
Winfried K. Grassmann, Xin Chen, Brij R. K. Kashyap:
Optimal service rates for the state-dependent M/G/1 queues in steady state. 57-63
Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Two-machine open shop scheduling with an availability constraint. 65-77
Csanád Imreh:
Online strip packing with modifiable boxes. 79-85
X. L. Sun, D. Li:
On the relationship between the integer and continuous solutions of convex programs. 87-92
Leah Epstein:
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. 93-98

Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems. 99-106
Alper Atamtürk:
Flow pack facets of the single node fixed-charge flow polytope. 107-114
Rhonda Righter, J. George Shanthikumar:
Optimal ordering of operations in a manufacturing chain. 115-121
Travis A. Dahl, Thomas R. Willemain:
The effect of long-memory arrivals on queue performance. 123-127
Tiru S. Arthanari, M. Usha:
On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem. 129-139
Philip Kaminsky, David Simchi-Levi:
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates. 141-148

Robert R. Goldberg, Jacob Shapiro:
Extending Graham's result on scheduling to other heuristics. 149-153
Adriana Felicia Bumb:
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. 155-161
B. Aghezzaf, T. Ouaderhman:
An interactive interior point algorithm for multiobjective linear programming problems. 163-170
Patrice Marcotte, Gilles Savard, D. L. Zhu:
A trust region algorithm for nonlinear bilevel programming. 171-179
Levent Tunçel:
On the Slater condition for the SDP relaxations of nonconvex sets. 181-186
Tamer Boyaci, Guillermo Gallego:
Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model. 187-192
Dequan Yue, Jinhua Cao:
Some results on successive failure times of a system with minimal instantaneous repairs. 193-197

Wolfgang Stadje, Dror Zuckerman:
A random walk model for a multi-component deteriorating system. 199-205
Vladimir G. Deineko, Gerhard J. Woeginger:
Hardness of approximation of the discrete time-cost tradeoff problem. 207-210
Moshe Haviv:
The Aumann-Shapley price mechanism for allocating congestion costs. 211-215
O. Rolando Gárciga, Alfredo N. Iusem, Benar Fux Svaiter:
On the need for hybrid steps in hybrid proximal point methods. 217-220
Geert Jan Franx:
A simple solution for the M/D/c waiting time distribution. 221-229
Johann Hurink, Sigrid Knust:
List scheduling in a parallel machine environment with precedence constraints and setup times. 231-239
Han Hoogeveen, Gerhard J. Woeginger:
A very difficult scheduling problem with communication delays. 241-245