Operations Research Letters, Volume 21

Volume 21, Number 1, August 1997

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

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

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

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

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

Last update Wed May 22 18:10:08 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page