Annals of Operations Research

1997 - 2025

Current editor(s): Endre Boros

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 87, month 4, 1999

Preface pp. 0-0

Liming Liu, Shouyang Wang and Shaohui Zheng

Sequential quality control in batch manufacturing pp. 3-30

D.D. Yao and S. Zheng

A review and interpretations of process capability indices pp. 31-47

K. Palmer and K.-L. Tsui

Impact of dynamic decision making on hub‐and‐spoke freight transportationnetworks pp. 49-71

R.K. Cheung and B. Muralidharan

Estimation of the most likely equilibrium traffic queueing pattern in a capacityconstrained network pp. 73-85

Hai Yang and S.C. Wong

Optimal pacing in an assembly-based multi-stage production system pp. 87-101

J.J. Liu and H. Chen

A discrete‐time model for perishable inventory systems pp. 103-116

Z. Lian and Lancui Liu

Fuzzy criterion models for inventory systems with partial backorders pp. 117-126

B. Liu

A comparison of unconstrained and constrained OLS for the combination ofdemand forecasts: A case study of the ordering and stocking of bank printed forms pp. 129-140

C.K. Chan, B.G. Kingsman and H. Wong

Modeling Shanghai stock market volatility pp. 141-152

J. Xu

An econometric analysis of development dynamics in modern Chinese industry pp. 153-164

A.B. Hammer

Logical analysis of Chinese labor productivity patterns pp. 165-176

A.B. Hammer, P.L. Hammer and I. Muchnik

Modelling and forecasting the money demand in China: Cointegration and non‐linearanalysis pp. 177-189

S. Deng and B. Liu

A forecasting method for manpower requirement and related optimal decisions pp. 191-198

Y. Guo, D. Pan and L. Zheng

Decision modelling of diversified project selection pp. 199-212

K.K. Lai and J. Xue

Estimating the performance of Sino‐Hong Kong joint ventures using neuralnetwork ensembles pp. 213-232

M.Y. Hu, M.S. Hung, B.E. Patuwo and M.S. Shanker

Measuring the timing ability of mutual fund managers pp. 233-234

Y. Yan

A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking pp. 247-261

N. Asadathorn and X. Chao

On performance potentials and conditional Monte Carlo for gradient estimationfor Markov chains pp. 263-272

X.-R. Cao, M.C. Fu and J.-Q. Hu

Basic adjoint relation for transient and stationary analysis of some Markovprocesses pp. 273-303

H. Chen

Revisiting the state transition frequency formula pp. 305-317

D. Shi

Busy periods of two‐stage tandem service systems and their algorithmic implementation pp. 319-332

X.-M. Yuan

A multi‐class cyclic arrival queue with a single server pp. 333-350

H. Zhang

A generalized projection quasi‐Newton method for nonlinear optimization problems pp. 353-362

Y. Lai, Z. Gao and G. He

A unified limited column generation approach for facility location problems ontrees pp. 363-382

D.X. Shaw

A class of constraint qualifications in nonsmooth optimization pp. 383-391

G. Tian, X. Li and T. Zhao

On quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm pp. 393-406

F. Wu, S. Wu and Y. Ye

Trust region dogleg path algorithms for unconstrained minimization pp. 407-418

J.-Z. Zhang and C.-X. Xu

Volume 86, month 1, 1999

Foreword pp. 0-0

Y.M. Sharaiha and John Beasley

A simulated annealing code for general integer linear programs pp. 3-21

D. Abramson and M. Randall

Simulated Jumping pp. 23-38

S. Amin

Introduction of a new class of variables to discrete and integer programmingproblems pp. 39-51

M.T. Hajian, R. Rodosek and B. Richards

On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function pp. 53-62

M. Libura

A new approach to integrating mixed integer programming and constraint logicprogramming pp. 63-87

R. Rodosek, M.G. Wallace and M.T. Hajian

A tabu search approach to the uncapacitated facility location problem pp. 91-103

K.S. Al‐Sultan and M.A. Al‐Fawzan

Logical reduction tests for the p‐problem pp. 105-115

P. Avella and A. Sforza

Upper and lower bounds for the two‐level simple plant location problem pp. 117-140

P. Chardaire, J.‐L. Lutton and A. Sutter

Solution algorithms for the capacitated single allocation hub location problem pp. 141-159

A.T. Ernst and M. Krishnamoorthy

Analysis of fault location in a network pp. 161-177

C.J. Hoelting, D.A. Schoenefeld and R.L. Wainwright

Applying Lagrangian relaxation to the resolution of two‐stage location problems pp. 179-198

A. Marín and B. Pelegrín

Exact sequential choice of locations in a network pp. 199-219

G.R. Mateus and J.‐M. Thizy

Locating a facility on a network with multiple median‐type objectives pp. 221-235

R.M. Ramos, M.T. Ramos, M. Colebrook and J. Sicilia

Optimisation of irregular multiprocessor computer architectures using geneticalgorithms pp. 239-257

C.J. Burgess and A.G. Chalmers

A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem pp. 259-270

D. Castelino and N. Stephens

The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel pp. 271-294

L. Gouveia and P. Martins

Minimal cost linkages in graphs pp. 295-319

S.A. Harrison and V.J. Rayward‐Smith

The Steiner tree problem with hop constraints pp. 321-345

S. Voß

Genetic algorithms and network ring design pp. 347-371

A.R.P. White, J.W. Mann and G.D. Smith

Scheduling maintenance services to three machines pp. 375-391

S. Anily, C.A. Glass and R. Hassin

Minimizing total completion time subject to release dates and sequence‐dependentprocessing times pp. 393-415

L. Bianco, P. Dell'Olmo and S. Giordani

A heuristic algorithm for two‐machine re‐entrant shop scheduling pp. 417-439

I.G. Drobouchevitch and V.A. Strusevich

A search space analysis of the Job Shop Scheduling Problem pp. 441-453

D.C. Mattfeld, C. Bierwirth and H. Kopfer

On the minimum number of processors for scheduling problems with communicationdelays pp. 455-472

A. Moukrim

Landscapes, operators and heuristic search pp. 473-490

C.R. Reeves

On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time pp. 491-506

M.G. Speranza and Zs. Tuza

Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine pp. 507-526

K. Tanaka and M. Vlach

New classes of efficiently solvable generalized Traveling Salesman Problems pp. 529-558

Egon Balas

An exact algorithm for a milk tanker scheduling and sequencing problem pp. 559-568

C. Basnet, L.R. Foulds and J.M. Wilson

New optimality cuts for a single‐vehicle stochastic routing problem pp. 569-584

C. Hjorring and J. Holt

A parallel algorithm for the vehicle routing problem with time window constraints pp. 585-607

J. Schulze and T. Fahle

A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems pp. 611-627

M.J. Brusco, L.W. Jacobs and G.M. Thompson

Exact solution of bin‐packing problems using column generation and branch‐and‐bound pp. 629-659

J.M. Valério de Carvalho