Operations Research Letters, Volume 26

Volume 26, Number 1, February 2000

Hanif D. Sherali, Gyunghyun Choi, Cihan H. Tuncbilek:
A variable target value method for nondifferentiable optimization. 1-8
Y. Salama:
Optimal control of a simple manufacturing system with restarting costs. 9-16
Leah Epstein, Jiri Sgall:
A lower bound for on-line scheduling on uniformly related machines. 17-22
Julián Aráoz:
Forward chaining is simple(x). 23-26
Gianpaolo Ghiani, Gennaro Improta:
An algorithm for the hierarchical Chinese postman problem. 27-32
Siriphong Lawphongpanich:
Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints. 33-41
Alfred Müller:
On the waiting times in queues with dependency between interarrival and service times. 43-47

Allen G. Holder, Richard J. Caron:
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights. 49-54
Michael M. Güntzer, Dieter Jungnickel:
Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem. 55-66
Qi-Ming He:
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models. 67-80
Susan M. Sanchez, Prabhudev Konana:
Efficient data allocation for frequency domain experiments. 81-89
Ruud H. Teunter, Edo S. Van der Poort:
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges. 91-98

Francisco Barahona:
On the k-cut problem. 99-105
Gerhard J. Woeginger:
A comment on scheduling on uniform machines under chain-type precedence constraints. 107-109
Emily Larson Luebke, J. Scott Provan:
On the structure and complexity of the 2-connected Steiner network problem in the plane. 111-116
Gerald G. Brown, Robert F. Dell, Michael P. Olson:
Valid integer polytope (VIP) penalties for branch-and-bound enumeration. 117-126
L. Grippo, M. Sciandrone:
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. 127-136
David Perry, Morton J. M. Posner:
A correlated M/G/1-type queue with randomized server repair and maintenance modes. 137-147

Michel X. Goemans, Joel Wein, David P. Williamson:
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. 149-154
Henk C. Tijms, R. Veldman:
A fast algorithm for the transient reward distribution in continuous-time Markov chains. 155-158
Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
Linear-shaped partition problems. 159-163
Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah:
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. 165-173
Christos Koulamas, George J. Kyparisis:
Scheduling on uniform parallel machines to minimize maximum lateness. 175-179
Vitaly A. Strusevich:
Group technology approach to the open shop scheduling problem with batch setup times. 181-192
Maxim Sviridenko:
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. 193-197

Attila Csenki:
Asymptotics for renewal-reward processes with retrospective reward structure. 201-209
Henrique Pacca Loureiro Luna, P. Mahey:
Bounds for global optimization of capacity expansion and flow assignment problems. 211-216
Guochuan Zhang, Xiaoqiang Cai, C. K. Wong:
Linear time-approximation algorithms for bin packing. 217-222
T. C. Edwin Cheng, Guoqing Wang:
An improved heuristic for two-machine flowshop scheduling with an availability constraint. 223-229
Shen Zheng, Andrew F. Seila:
Some well-behaved estimators for the M/M/1 queue. 231-235
Lars Thorlund-Petersen:
Comparison of probability measures: Dominance of the third degree. 237-245