Printed from https://ideas.repec.org/s/spr/annopr33.html
Content
January 2000, Volume 93, Issue 1
- 71-90 The multiple server effect: Optimal allocation of servers to stations with different service‐time distributions in tandem queueing networks
by Kenichi Futamura - 91-115 A decomposition method for analyzing inhomogeneous assembly/disassembly systems
by Stanley Gershwin & Mitchell Burman - 117-144 Efficient algorithms for buffer space allocation
by Stanley Gershwin & James Schor - 145-176 Production systems with interruptions, arbitrary topology and finite buffers
by Surendra Gupta & Ayse Kavusturucu - 177-216 Simulation optimization of buffer allocations in production lines with unreliable machines
by Gül Gürkan - 217-243 Approximate analysis of unreliable transfer lines with splits in the flow of material
by Stefan Helber - 245-264 Sensitivity analysis and decomposition of unreliable production lines with blocking
by Vassilis Kouikoglou - 265-297 A robust decomposition method for the analysis of production lines with unreliable machines and finite buffers
by Hervé Le Bihan & Yves Dallery - 299-324 Production variability in manufacturing systems: Bernoulli reliability case
by Jingshan Li & Semyon Meerkov - 325-355 A unified framework for pull control mechanisms in multi‐stage manufacturing systems
by George Liberopoulos & Yves Dallery - 357-372 A two‐level queueing network model with blocking and non‐blocking messages
by S. Ramesh & H.G. Perros - 373-384 A simulated annealing approach for buffer allocation in reliable production lines
by Diomidis Spinellis & Chrissoleon Papadopoulos - 385-403 Asymptotic variance rate of the output in production lines with finite buffers
by Barış Tan - 405-421 Modeling and analysis of multi‐stage transfer lines with unreliable machines and finite buffers
by Sheng Yang & Cheng Wu & S. Hu - 423-446 Capacity analysis of an automated kit transportation system
by W.H.M. Zijm & I.J.B.F. Adan & R. Buitenhek & G.J. van Houtum
January 1999, Volume 92, Issue 0
- 1-18 A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks
by K.D. Glazebrook & J. Niño‐Mora - 19-43 Almost optimal policies for stochastic systemswhich almost satisfy conservation laws
by K.D. Glazebrook & R. Garbe - 45-63 Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints
by K. Neumann & W.G. Schneider - 65-86 An algorithm for minimum wait drainingof two‐station fluid re‐entrant line
by G. Weiss - 87-105 Scheduling multi‐operation jobs on a single machine
by A.E. Gerodimos & C.A. Glass & C.N. Potts & T. Tautenhahn - 107-123 Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
by J.N.D. Gupta & A.M.A. Hariri & C.N. Potts - 125-142 The setup polytope of N‐sparse posets
by R. Schrader & G. Wambach - 143-164 Recovering cyclic schedules from delay
by R. Wegner - 165-183 A new lower bound for the open‐shop problem
by C. Guéret & C. Prins - 185-210 A polynomial algorithm for the three‐machineopen shop with a bottleneck machine
by I.G. Drobouchevitch & V.A. Strusevich - 211-239 When difference in machine loads leadsto efficient scheduling in open shops
by A. Kononov & S. Sevastianov & I. Tchernykh - 241-263 On the set of solutions of the open shop problem
by H. Bräsel & M. Harborth & T. Tautenhahn & P. Willenius - 265-279 On the hardness of the classical job shop problem
by H. Bräsel & M. Harborth & T. Tautenhahn & P. Willenius - 281-304 Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs
by N.V. Shakhlevich & N. Sotskov & F. Werner - 305-333 Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems
by Ph. Baptiste & C. Le Pape & W. Nuijten - 335-348 Cardinality constrained bin‐packing problems
by H. Kellerer & U. Pferschy - 349-361 Scheduling a round robin tennis tournamentunder courts and players availability constraints
by F. Della Croce & R. Tadei & P.S. Asioli - 363-380 Scheduling chicken catching ‐ An investigationinto the success of a genetic algorithm on areal‐world scheduling problem
by E. Hart & P. Ross & J.A.D. Nelson - 381-401 The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly
by J.I. van Zante-de Fokkert & A.G. de Kok
January 1999, Volume 91, Issue 0
- 1-10 Reliability and maintenance in production control ‐ an introduction
by Z. Sinuany-Stern - 11-24 Achieving growth in reliability
by J. Ansell & L. Walls & J. Quigley - 25-40 A simple suboptimal algorithm for system maintenanceunder partial observability
by I. David & L. Friedman & Z. Sinuany‐Stern - 41-47 Throughput‐dependent periodic maintenance policiesfor general production units
by E. Iakovou & C.M. Ip & C. Koulamas - 49-62 Optimal control of assembling complexes underpredetermined maintenance conditions
by K. Kogan & E. Levner - 63-82 On replacement policies for additive systemswith several working levels
by Mallor & Azcárate - 83-104 Selecting a quality control attribute sample:An information‐economics method
by N. Margaliot - 105-122 A Bayesian Dynamic Programming approach tooptimal maintenance combined with burn‐in
by E. Nicolato & W.J. Runggaldier - 123-136 Inventory models with unreliable suppliersin a random environment
by S. Özekici & M. Parlar - 137-161 Optimal Stress Screening strategies formulti‐component systems sold under warranty:The case of phase‐type lifetimes
by E.A. Pohl & D.L. Dietrich - 163-198 Group replacement policies for parallel systems whosecomponents have phase distributed failure times
by E. Popova & J.G. Wilson - 191-204 Stochastic modeling of fatigue crack damagefor information‐based maintenance
by A. Ray & S. Phoha - 205-225 Optimal capacity and operation of deterioratingchemical production service facilities
by E. Shemesh & G. Rabinowitz & A. Mehrez - 227-250 A general ordering policy with number‐dependentminimal repair and random lead time
by s.‐H. Sheu - 251-261 A general solution of the preventive maintenanceproblem when data are right‐censored
by H. Shore - 263-280 A general hazard regression modelfor accelerated life testing
by H.‐-J Shyur & E.A. Elsayed & J.T. Luxhøj - 281-287 Optimal surveillance of a failure system
by W. Stadje & D. Zuckerman - 289-304 Control of production processes subjectto random shocks
by E. Collani - 305-318 Some maintenance models and availability withimperfect maintenance in production systems
by H. Wang & H. Pham - 319-337 Modeling diminishing marginal returns in ahierarchical inventory system of reparable spare parts
by W.L. Zorn & R.F. Deckro & L.J. Lehmkuhl
January 1999, Volume 90, Issue 0
- 1-17 On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search
by J. Clausen & M. Perregaard - 19-43 Computational experience with parallel mixed integerprogramming in a distributed environment
by R.E. Bixby & W. Cook & A. Cox & E.K. Lee - 45-63 The parallel search bench ZRAM and its applications
by A. Brüngger & A. Marzetta & K. Fukuda & J. Nievergelt - 65-86 A parallel branch‐and‐bound methodfor cluster analysis
by L.S. Iyer & J.E. Aronson - 87-129 Scalable parallel computations forlarge-scale stochastic programming
by H. Vladimirou & S.A. Zenios - 131-160 A parallel computation approach for solvingmultistage stochastic network problems
by L.F. Escudero & J.L. De La Fuente & C. García & F.J. Prieto - 161-184 EVPI‐based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures
by M.A.H. Dempster & R.T. Thompson - 185-202 Parallel local search for Steiner trees in graphs
by M.G.A. Verhoeven & M.E.M. Severens - 203-219 Experiences with fine‐grainedparallel genetic algorithms
by U. Kohlmorgen & H. Schmeck & K. Haase - 221-246 Scheduling parallel tasks withsequential heads and tails
by M. Drozdowski & W. Kubiak - 247-270 Parallel proximal decomposition algorithmsfor robust estimation
by M.L. Bougeard & C.D. Caquineau - 271-291 A parallel algorithm for the global minimizationof Gibbs free energy
by S. Berner & K.I.M. McKinnon & C. Millar - 293-322 Distributed‐ and shared‐memory parallelizationsof assignment‐based data association formultitarget tracking
by R.L. Popp & K.R. Pattipati & Y. Bar-Shalom
January 1999, Volume 89, Issue 0
- 3-19 Economic models and the relevance of “chaotic regions”:An application to Goodwin's growth cycle model
by S. Sordi - 21-34 Adaptively evolving expectations in models of monetarydynamics‐ The fundamentalists forward looking
by C. Chiarella & P. Khomin - 35-59 Keynesian monetary growth dynamicsin open economies
by C. Chiarella & P. Flaschel - 61-73 Asymptotic growth ratesin knowledge‐exchanging economies
by V.F. Borisov & G. Hutschenreiter & A.V. Kryazhimskii - 75-87 Investment and finance: A theoretical approach
by T. Asada - 89-100 The Kaldor‐Kalecki business cycle model
by A. Krawiec & M. Szydlowski - 101-123 Preferable disequilibrium in a nonlinearcobweb economy
by A. Matsumoto - 125-148 Modelling chaotic behaviour in agricultural pricesusing a discrete deterministic nonlinear price model
by Z. Bacsi & B. Vizvári - 149-164 Price adjustment models in a production economy
by C. Weddepohl - 165-173 Nonlinear dynamics in the Cournot modelwithout full information
by D. Léonard & K. Nishimura - 177-194 Dynamic externalities:Comparing conditions for Hopf bifurcationunder laissez‐faire and planning
by F. Wirl - 195-214 Local dynamics for optimal control problemsof three‐dimensional ODE systems
by P.M.B. Brito - 215-230 Markov Perfect Equilibria for a classof capital accumulation games
by E.J. Dockner & M. Plank & K. Nishimura - 233-251 The spatially dominant equilibrium of a game
by J. Hofbauer - 252-271 Symmetry‐breaking bifurcations and representativefirm in dynamic duopoly games
by G.‐I. Bischi & M. Gallegati & A. Naimzada - 273-295 On the dynamics of word of mouth learningwith and without anticipations
by H. Dawid - 297-318 Genetic engineering via negative fitness:Evolutionary dynamics for global optimization
by I.M. Bomze & V. Stix - 319-328 An improved Ant System algorithm for theVehicle Routing Problem
by B. Bullnheimer & R.F. Hartl & C. Strauss
January 1999, Volume 88, Issue 0
- 3-14 Sufficient conditions and sensitivity analysisfor economic control problems
by H. Maurer - 15-29 Optimal advertising with a continuum of goods
by E. Barucci & F. Gozzi - 31-45 A multiperiod production and advertising problemfor a seasonal product
by D. Favaretto & B. Viscolani - 47-64 Fiscal policy in a Lucasian general equilibrium modelwith productive government spending
by D.A. Wöhrmann - 65-79 An endogenous growth model with public capitaland government borrowing
by A. Greiner & W. Semmler - 81-98 Optimal firm investment in security
by P.M. Kort & J.L. Haunschmied & G Feichtinger - 99-117 Optimal investment facing possible accidents
by R.F. Hartl & P.M. Kort & A.J. Novak - 121-137 Optimal consumption and exploration: A case studyin piecewise‐deterministic Markov modelling
by M. Farid & M.H.A. Davis - 139-159 Application of the impulsive control of piecewisedeterministic processes to multi‐item single machinestochastic scheduling
by A. Jean-Marie & M.M. Tidball - 161-171 Almost sure optimality and optimality in probabilityfor stochastic control problems over aninfinite time horizon
by P. Dai Pra & G.B. Di Masi & B. Trivellato - 173-182 Sustainability in small open economiesunder uncertainty
by S. Katayama & H. Ohta - 183-197 Fractal steady states instochastic optimal control models
by L. Montrucchio & F. Privileggi - 199-214 On one aspect of science policy based onan uncertain model
by C.S. Lee & G. Leitmann - 217-232 Optimal open loop cheating in dynamic reversedLinear ‐ Quadratic Stackelberg games
by T. Vallée & Ch. Deissenberg & T. Basar - 233-249 Dynamic games of fiscal and monetary policiesfor Austria
by R. Neck - 251-273 The (in)finite horizon open‐loop Nash LQ game:An application to EMU
by J.C. Engwerda & B. Aarle & J.E.J. Plasmans - 275-289 Inter‐ and intragenerational renewableresource extraction
by S. Jørgensen & D.W.K. Yeung - 291-307 The dynamics of the strategic capital accumulation
by C. Figuières & P. Gardères & P. Michel & F. Rychen - 309-336 Capital accumulation subject to pollution control:Open‐loop versus feedback investment strategies
by M. Stimming - 337-359 Control synthesis in grid schemesfor Hamilton‐Jacobi equations
by A.M. Tarasyev - 361-377 Dynamics in divide the money game with bribing
by V. Pasetta
April 1999, Volume 87, Issue 0
- 0 Preface
by Liming Liu & Shouyang Wang & Shaohui Zheng - 3-30 Sequential quality control in batch manufacturing
by D.D. Yao & S. Zheng - 31-47 A review and interpretations of process capability indices
by K. Palmer & K.-L. Tsui - 49-71 Impact of dynamic decision making on hub‐and‐spoke freight transportationnetworks
by R.K. Cheung & B. Muralidharan - 73-85 Estimation of the most likely equilibrium traffic queueing pattern in a capacityconstrained network
by H. Yang & S.C. Wong - 87-101 Optimal pacing in an assembly-based multi-stage production system
by J.J. Liu & H. Chen - 103-116 A discrete‐time model for perishable inventory systems
by Z. Lian & L. Liu - 117-126 Fuzzy criterion models for inventory systems with partial backorders
by B. Liu - 129-140 A comparison of unconstrained and constrained OLS for the combination ofdemand forecasts: A case study of the ordering and stocking of bank printed forms
by C.K. Chan & B.G. Kingsman & H. Wong - 141-152 Modeling Shanghai stock market volatility
by J. Xu - 153-164 An econometric analysis of development dynamics in modern Chinese industry
by A.B. Hammer - 165-176 Logical analysis of Chinese labor productivity patterns
by A.B. Hammer & P.L. Hammer & I. Muchnik - 177-189 Modelling and forecasting the money demand in China: Cointegration and non‐linearanalysis
by S. Deng & B. Liu - 191-198 A forecasting method for manpower requirement and related optimal decisions
by Y. Guo & D. Pan & L. Zheng - 199-212 Decision modelling of diversified project selection
by K.K. Lai & J. Xue - 213-232 Estimating the performance of Sino‐Hong Kong joint ventures using neuralnetwork ensembles
by M.Y. Hu & M.S. Hung & B.E. Patuwo & M.S. Shanker - 233-234 Measuring the timing ability of mutual fund managers
by Y. Yan - 247-261 A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking
by N. Asadathorn & X. Chao - 263-272 On performance potentials and conditional Monte Carlo for gradient estimationfor Markov chains
by X.-R. Cao & M.C. Fu & J.-Q. Hu - 273-303 Basic adjoint relation for transient and stationary analysis of some Markovprocesses
by H. Chen - 305-317 Revisiting the state transition frequency formula
by D. Shi - 319-332 Busy periods of two‐stage tandem service systems and their algorithmic implementation
by X.-M. Yuan - 333-350 A multi‐class cyclic arrival queue with a single server
by H. Zhang - 353-362 A generalized projection quasi‐Newton method for nonlinear optimization problems
by Y. Lai & Z. Gao & G. He - 363-382 A unified limited column generation approach for facility location problems ontrees
by D.X. Shaw - 383-391 A class of constraint qualifications in nonsmooth optimization
by G. Tian & X. Li & T. Zhao - 393-406 On quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm
by F. Wu & S. Wu & Y. Ye - 407-418 Trust region dogleg path algorithms for unconstrained minimization
by J.-Z. Zhang & C.-X. Xu
January 1999, Volume 86, Issue 0
- 0 Foreword
by Y.M. Sharaiha & J.E. Beasley - 3-21 A simulated annealing code for general integer linear programs
by D. Abramson & M. Randall - 23-38 Simulated Jumping
by S. Amin - 39-51 Introduction of a new class of variables to discrete and integer programmingproblems
by M.T. Hajian & R. Rodosek & B. Richards - 53-62 On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function
by M. Libura - 63-87 A new approach to integrating mixed integer programming and constraint logicprogramming
by R. Rodosek & M.G. Wallace & M.T. Hajian - 91-103 A tabu search approach to the uncapacitated facility location problem
by K.S. Al‐Sultan & M.A. Al‐Fawzan - 105-115 Logical reduction tests for the p‐problem
by P. Avella & A. Sforza - 117-140 Upper and lower bounds for the two‐level simple plant location problem
by P. Chardaire & J.‐L. Lutton & A. Sutter - 141-159 Solution algorithms for the capacitated single allocation hub location problem
by A.T. Ernst & M. Krishnamoorthy - 161-177 Analysis of fault location in a network
by C.J. Hoelting & D.A. Schoenefeld & R.L. Wainwright - 179-198 Applying Lagrangian relaxation to the resolution of two‐stage location problems
by A. Marín & B. Pelegrín - 199-219 Exact sequential choice of locations in a network
by G.R. Mateus & J.‐M. Thizy - 221-235 Locating a facility on a network with multiple median‐type objectives
by R.M. Ramos & M.T. Ramos & M. Colebrook & J. Sicilia - 239-257 Optimisation of irregular multiprocessor computer architectures using geneticalgorithms
by C.J. Burgess & A.G. Chalmers - 259-270 A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem
by D. Castelino & N. Stephens - 271-294 The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel
by L. Gouveia & P. Martins - 295-319 Minimal cost linkages in graphs
by S.A. Harrison & V.J. Rayward‐Smith - 321-345 The Steiner tree problem with hop constraints
by S. Voß - 347-371 Genetic algorithms and network ring design
by A.R.P. White & J.W. Mann & G.D. Smith - 375-391 Scheduling maintenance services to three machines
by S. Anily & C.A. Glass & R. Hassin - 393-415 Minimizing total completion time subject to release dates and sequence‐dependentprocessing times
by L. Bianco & P. Dell'Olmo & S. Giordani - 417-439 A heuristic algorithm for two‐machine re‐entrant shop scheduling
by I.G. Drobouchevitch & V.A. Strusevich - 441-453 A search space analysis of the Job Shop Scheduling Problem
by D.C. Mattfeld & C. Bierwirth & H. Kopfer - 455-472 On the minimum number of processors for scheduling problems with communicationdelays
by A. Moukrim - 473-490 Landscapes, operators and heuristic search
by C.R. Reeves - 491-506 On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time
by M.G. Speranza & Zs. Tuza - 507-526 Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine
by K. Tanaka & M. Vlach - 529-558 New classes of efficiently solvable generalized Traveling Salesman Problems
by E. Balas - 559-568 An exact algorithm for a milk tanker scheduling and sequencing problem
by C. Basnet & L.R. Foulds & J.M. Wilson - 569-584 New optimality cuts for a single‐vehicle stochastic routing problem
by C. Hjorring & J. Holt - 585-607 A parallel algorithm for the vehicle routing problem with time window constraints
by J. Schulze & T. Fahle - 611-627 A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems
by M.J. Brusco & L.W. Jacobs & G.M. Thompson - 629-659 Exact solution of bin‐packing problems using column generation and branch‐and‐bound
by J.M. Valério de Carvalho
January 1999, Volume 85, Issue 0
- 0 Planning under uncertainty
by G.B. Dantzig - 1-19 Duality and optimality in multistagestochastic programming
by R.T. Rockafellar - 21-38 The use of discrete moment bounds in probabilisticconstrained stochastic programming models
by András Prékopa - 39-57 Stochastic integer programming:General models and algorithms
by Willem Klein Haneveld & Maarten van der Vlerk - 59-78 Stochastic programs and statistical data
by Georg Pflug - 79-101 Statistical estimation from an optimization viewpoint
by Roger Wets - 103-127 Bound‐based approximations in multistage stochasticprogramming: Nonanticipativity aggregation
by N.C.P. Edirisinghe - 129-152 Gains and costs of informationin stochastic programming
by Zvi Artstein - 153-172 Some advances in decomposition methodsfor stochastic linear programming
by Andrzej Ruszczynski - 173-193 Statistical approximations forstochastic linear programming problems
by Julia Higle & Suvrajeet Sen - 193-225 Growth versus security tradeoffs indynamic investment analysis
by Leonard MacLean & William Ziemba - 227-247 Scenario modeling for the management ofinternational bond portfolios
by Andrea Beltratti & Andrea Consiglio & Stavros Zenios - 249-266 Linking strategic and tactical planning systemsfor asset and liability management
by John Mulvey & Chris Madsen & François Morin - 267-284 The practice of portfolio replication. A practical overview of forward and inverse problems
by Ron Dembo & Dan Rosen
December 1998, Volume 84, Issue 0
- 0 Preface
by García-Jurado & Valenciano & Winter - 3-27 Nash equilibrium in multiparty competitionwith “stochastic” voters
by Norman Schofield & Itai Sened & David Nixon - 29-43 A comparative overview ofcryptographic voting protocols
by Hannu Nurmi & Arto Salomaa - 45-59 The Spanish electoral system:Proportionality and governability
by M.L. Márquez & V. Ramírez - 63-78 Extension of values to games withmultiple alternatives
by R. Amer & F. Carreras & A. Magaña - 79-95 Probabilistic values on convex geometries
by J.M. Bilbao & E. Lebrón & N. Jiménez - 97-109 Complete games with minimum
by J. Freixas & M.A. Puente - 111-120 On the intersection between the imputation setand the Weber set
by F. Javier Martinez-de-Albeniz & Carles Rafels - 121-133 On extreme points of the core and reduced games
by Marina Núñez & Carles Rafels - 137-164 General aggregation of demandand cost sharing methods
by Stef Tijs & Maurice Koster - 167-185 Credible equilibria in non-finite games and ingames without perfect recall
by P. Corcho Sánchez & J.L. Ferreira García - 187-194 Unilateral commitment in the finitely repeated prisoners' dilemma
by Andrés Faíña-Medín & Ignacio García-Jurado & José Méndez-Naya & Luciano Méndez-Naya - 195-208 Two-person non-zero-sum gamesas multicriteria goal games
by F.R. Fernández & J. Puerto & L. Monroy - 209-230 Cooperative solutions in an economic growth game
by Carlos González-Alcón & Joaquín Sicilia & José Álvarez - 231-238 On the structure of the set of Nash equilibriaof weakly nondegenerate bimatrix games
by Hans Keiding
October 1998, Volume 83, Issue 0
- 0 Preface
by Heidemarie Bräsel & Frank Werner