Journal: Oper. Res. Lett.

Volume 30, Issue 6

351 -- 359Anat Kopzon, Gideon Weiss. A push-pull queueing system
360 -- 374Antonio Gómez-Corral. A matrix-geometric approximation for tandem queues with blocking and repeated attempts
375 -- 376Jesus R. Artalejo. A note on the optimality of the ::::N::::- and ::::D::::-policies for the ::::M::::/::::G::::/1 queue
377 -- 386Nelly Litvak, Ivo J. B. F. Adan. On a class of order pick strategies in paternosters
387 -- 393Jinn-Tsair Teng, Horng-Jinh Chang, Chung-Yuan Dye, Cheng-Hsing Hung. An optimal replenishment policy for deteriorating items with time-varying demand and partial backlogging
394 -- 400Jean B. Lasserre, Eduardo S. Zeron. Solving the knapsack problem via Z-transform
401 -- 407Yifan Xu, Duan Li. A nonlinear Lagrangian dual for integer programming
408 -- 414Zhiyi Tan, Yong He. Semi-on-line problems on two identical machines with combined partial information
415 -- 420Leah Epstein, John Noga, Gerhard J. Woeginger. On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Volume 30, Issue 5

281 -- 288A. Brown, A. Gedlaman, A. Holder, S. Martinez. An extension of the fundamental theorem of linear programming
289 -- 294Earl Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson. A least-squares primal-dual algorithm for solving linear programming problems
295 -- 307Jerzy A. Filar, Eitan Altman, Konstantin Avrachenkov. An asymptotic simplex method for singularly perturbed linear programs
308 -- 318Vidyadhar G. Kulkarni, Elena I. Tzenova. Mean first passage times in fluid queues
319 -- 326Michael Sherman, David Goldsman. Large-sample normality of the batch-means variance estimator
327 -- 332Alexander A. Ageev. Improved approximation algorithms for multilevel facility location problems
333 -- 335Jiawei Zhang, Yinyu Ye. A note on the maximization version of the multi-level facility location problem
336 -- 342Alain Billionnet. Approximation algorithms for fractional knapsack problems
343 -- 350Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Volume 30, Issue 4

211 -- 222Bart De Schutter, W. P. M. H. Heemels, Alberto Bemporad. On the equivalence of linear complementarity problems
223 -- 230Félix Belzunce, Rosa E. Lillo, Franco Pellerey, Moshe Shaked. Preservation of association in multivariate shock and claim models
231 -- 244Tomoyuki Kodera, Masakiyo Miyazawa. An ::::M::::/::::G::::/1 queue with Markov-dependent exceptional service times
245 -- 251David Perry, Morton J. M. Posner. A mountain process with state dependent input and output and a correlated dam
252 -- 264Virginie Gabrel, Michel Minoux. A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
265 -- 268Hervé Kerivin, Ali Ridha Mahjoub. Separation of partition inequalities for the (1, 2)-survivable network design problem
269 -- 275Leah Epstein, Lene M. Favrholdt. Optimal preemptive semi-online scheduling to minimize makespan on two related machines
276 -- 280Alexander Kononov, Maxim Sviridenko. A linear time approximation scheme for makespan minimization in an open shop with release dates

Volume 30, Issue 3

141 -- 148Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam. A network simplex algorithm with O(::::n::::) consecutive degenerate pivots
149 -- 158Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir. Algorithmic results for ordered median problems
159 -- 166David J. Rader Jr., Gerhard J. Woeginger. The quadratic 0-1 knapsack problem with series-parallel support
167 -- 168Gerhard J. Woeginger. Embeddings of planar graphs that minimize the number of long-face cycles
169 -- 173Brady Hunsaker, Martin W. P. Savelsbergh. Efficient feasibility testing for dial-a-ride problems
174 -- 180Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae. Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system
181 -- 188Anand Paul. On bivariate dependence and the convex order
189 -- 194John D. Lamb, Russell C. H. Cheng. Optimal allocation of runs in a simulation metamodel with several independent variables
195 -- 201Doo-Hyun Choi. Cooperative mutation based evolutionary programming for continuous function optimization
202 -- 210Zhenghai Huang. Sufficient conditions on nonemptiness and boundedness of the solution set of the ::::P::::::0:: function nonlinear complementarity problem

Volume 30, Issue 2

71 -- 73Adam N. Letchford. Totally tight Chvátal-Gomory cuts
74 -- 82Adam N. Letchford, Andrea Lodi. Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
83 -- 88Wenxun Xing. A bin packing problem with over-sized items
89 -- 96Leen Stougie, Arjen P. A. Vestjens. Randomized algorithms for on-line scheduling problems: how low can t you go?
97 -- 99Gregory Gutin, Anders Yeo. Anti-matroids
100 -- 106Wooseung Jang, Cerry M. Klein. Minimizing the expected number of tardy jobs when processing times are normally distributed
107 -- 116Liu Jianyong. Notes on average Markov decision processes with a minimum-variance criterion
117 -- 129Esmail Mohebbi, Morton J. M. Posner. Multiple replenishment orders in a continuous-review inventory system with lost sales
130 -- 140Gustavo Bergantiños, Estela Sánchez. NTU PERT games

Volume 30, Issue 1

1 -- 8Kenneth R. Baker, Michael J. Magazine, George G. Polak. Optimal block design models for course timetabling
9 -- 16Gerhard J. Woeginger. An efficient algorithm for a class of constraint satisfaction problems
17 -- 18Dieter Fiems, Herwig Bruneel. A note on the discretization of Little s result
19 -- 24Robert D. Foley, Byung Chun Park. Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
25 -- 32Nam K. Kim, Seok Ho Chang, Kyung C. Chae. On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
33 -- 42J. P. C. Blanc. On the numerical inversion of busy-period related transforms
43 -- 48Edmond J. Vanderperre, Stanislav S. Makhanov. On Gaver s parallel system sustained by a cold standby unit and attended by two repairmen
49 -- 56Siriphong Lawphongpanich. A nontangential cutting plane algorithm
57 -- 65Robert D. Carr, Giuseppe Lancia. Compact vs. exponential-size LP relaxations
66 -- 68C. T. Ng, T. C. Edwin Cheng, J. J. Yuan. A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
69 -- 70Albert Corominas. A remark about A comment on consecutive-2-out-of-::::n:::: systems