Journal: Oper. Res. Lett.

Volume 21, Issue 5

211 -- 217David R. Wood. An algorithm for finding a maximum clique in a graph
219 -- 223Zeev Nutov, Michal Penn. Faster approximation algorithms for weighted triconnectivity augmentation problems
225 -- 227Michel Burlet, Olivier Goldschmidt. A new and improved algorithm for the 3-cut problem
229 -- 233Jean-François Hêche, Thomas M. Liebling. Finding minimum area simple pentagons
235 -- 242Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza. Semi on-line algorithms for the partition problem
243 -- 248Christian Ewerhart. Bayesian optimization and genericity
249 -- 252Makoto Doi, Yow-Mow Chen, Hideo Osawa. A queueing model in which arrival times are scheduled

Volume 21, Issue 4

159 -- 164Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir. Structured ::::p::::-facility location problems on the line solvable in polynomial time
165 -- 169Bo Chen, Arjen P. A. Vestjens. Scheduling on identical machines: How good is LPT in an on-line setting?
171 -- 179Vladimir Kats, Eugene Levner. A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
181 -- 189P. Wu, Morton J. M. Posner. A level-crossing approach to the solution of the shortest-queue problem
191 -- 200Koichi Nakade, Katsuhisa Ohno, J. George Shanthikumar. Bounds and approximations for cycle times of a U-shaped production line
201 -- 208Nico M. van Dijk, Masakiyo Miyazawa. Error bounds on a practical approximation for finite tandem queues

Volume 21, Issue 3

107 -- 114John R. Birge, Kevin D. Glazebrook. Bounds on optimal values in stochastic scheduling
115 -- 122Clifford Stein, Joel Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time
123 -- 132Dimitris Bertsimas, Chung-Piaw Teo. The parsimonious property of cut covering problems and its applications
133 -- 137Refael Hassin, Shlomi Rubinstein, Arie Tamir. Approximation algorithms for maximum dispersion
139 -- 145Jiang Chen, George Steiner. Approximation methods for discrete lot streaming in flow shops
147 -- 152J. L. Nazareth. Deriving potential functions via a symmetry principle for nonlinear equations
153 -- 158Irwin Greenberg. Markov chain approximation methods in a class of level-crossing problems

Volume 21, Issue 2

55 -- 64Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen. Potential reduction algorithms for structured combinatorial optimization problems
65 -- 67William S. Griffith. A note on the characterization of the Barlow and Wu continuum structure functions
69 -- 76Zhi-Long Chen, Qing Lu, Guochun Tang. Single machine scheduling with discretely controllable processing times
77 -- 80Jay B. Ghosh, Jatinder N. D. Gupta. Batch scheduling to minimize maximum lateness
81 -- 85A. Zaporozhets. A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems
87 -- 94John J. Hasenbein. Necessary conditions for global stability of multiclass queueing networks
95 -- 100Andreas Frey, Yoshitaka Takahashi. A note on an M/GI/1/N queue with vacation time and exhaustive service discipline
101 -- 106Frank N. Gouweleeuw. The loss probability in an overloaded queue using the dual queue

Volume 21, Issue 1

1 -- 9Hanif D. Sherali, Cihan H. Tuncbilek. New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
11 -- 18Vitaly A. Strusevich, L. A. Hall. An open shop scheduling problem with a non-bottleneck machine
19 -- 23Fangruo Chen, Yu-Sheng Zheng. Sensitivity analysis of an (s, S) inventory model
25 -- 30K. Szkatuza. The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
31 -- 37Nan Zhu, Kevin A. Broughan. On dominated terms in the general knapsack problem
39 -- 42Jinxing Xie. Polynomial algorithms for single machine scheduling problems with financial constraints
43 -- 53Mohamed Haouari, Rym M Hallah. Heuristic algorithms for the two-stage hybrid flowshop problem