Journal: Oper. Res. Lett.

Volume 29, Issue 5

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

Volume 29, Issue 4

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

Volume 29, Issue 3

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

Volume 29, Issue 2

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

Volume 29, Issue 1

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