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
  Electronic Edition (link) BibTeX
• George J. Kyparisis, Christos Koulamas:
  A note on weighted completion time minimization in a flexible flow shop. 5-11
  Electronic Edition (link) BibTeX
• Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger:
  A polynomially solvable special case of the unbounded knapsack problem. 13-16
  Electronic Edition (link) BibTeX
• Gaurav Singh:
  Performance of critical path type algorithms for scheduling on parallel processors. 17-30
  Electronic Edition (link) BibTeX
• Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
  The robust spanning tree problem with interval data. 31-40
  Electronic Edition (link) BibTeX
• Feng Zhang, Guochun Tang, Zhi-Long Chen:
  A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times. 41-47
  Electronic Edition (link) BibTeX

Volume 29, Number 2, September 2001

• Ismael R. de Farias Jr., George L. Nemhauser:
  A family of inequalities for the generalized assignment polytope. 49-55
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
  Two-machine open shop scheduling with an availability constraint. 65-77
  Electronic Edition (link) BibTeX
• Csanád Imreh:
  Online strip packing with modifiable boxes. 79-85
  Electronic Edition (link) BibTeX
• X. L. Sun, D. Li:
  On the relationship between the integer and continuous solutions of convex programs. 87-92
  Electronic Edition (link) BibTeX
• Leah Epstein:
  Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. 93-98
  Electronic Edition (link) BibTeX

Volume 29, Number 3, October 2001

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

Volume 29, Number 4, November 2001

• Robert R. Goldberg, Jacob Shapiro:
  Extending Graham's result on scheduling to other heuristics. 149-153
  Electronic Edition (link) BibTeX
• Adriana Felicia Bumb:
  An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. 155-161
  Electronic Edition (link) BibTeX
• B. Aghezzaf, T. Ouaderhman:
  An interactive interior point algorithm for multiobjective linear programming problems. 163-170
  Electronic Edition (link) BibTeX
• Patrice Marcotte, Gilles Savard, D. L. Zhu:
  A trust region algorithm for nonlinear bilevel programming. 171-179
  Electronic Edition (link) BibTeX
• Levent Tunçel:
  On the Slater condition for the SDP relaxations of nonconvex sets. 181-186
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Dequan Yue, Jinhua Cao:
  Some results on successive failure times of a system with minimal instantaneous repairs. 193-197
  Electronic Edition (link) BibTeX

Volume 29, Number 5, December 2001

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