European Journal of Operational Research

1977 - 2025

Current editor(s): Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

From Elsevier
Bibliographic data for series maintained by Catherine Liu ().

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 165, issue 3, 2005

Polynomial approximation algorithms with performance guarantees: An introduction-by-example pp. 555-568

Marc Demange and Vangelis Th. Paschos

Applying the minimax criterion in stochastic recourse programs pp. 569-584

Morten Riis and Kim Allan Andersen

Multiobjective second-order symmetric duality with F-convexity pp. 585-591

X. M. Yang, X. Q. Yang, K. L. Teo and S. H. Hou

Symmetric duality in multiobjective programming involving generalized cone-invex functions pp. 592-597

Seema Khurana

Stabilization of Mehrotra's primal-dual algorithm and its implementation pp. 598-609

Predrag S. Stanimirovic, Nebojsa V. Stojkovic and Vera V. Kovacevic-Vujcic

Distribution network design: New problems and related models pp. 610-624

Daniela Ambrosino and Maria Grazia Scutella

Partial convexification cuts for 0-1 mixed-integer programs pp. 625-648

Hanif D. Sherali, Youngho Lee and Youngjin Kim

A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem pp. 649-656

Claudio Thomas Bornstein, Luciane Ferreira Alcoforado and Nelson Maculan

A heuristic algorithm for the truckload and less-than-truckload problem pp. 657-667

Ching-Wu Chu

Vehicle minimization for periodic deliveries pp. 668-684

Ann Melissa Campbell and Jill R. Hardin

A Bayesian approach for assessing process precision based on multiple samples pp. 685-695

W. L. Pearn and Chien-Wei Wu

Entropy as a measure of operational flexibility pp. 696-707

Eyas Shuiabi, Vince Thomson and Nadia Bhuiyan

The shift team formation problem in multi-shift manufacturing operations pp. 708-728

Jannes Slomp and Nallan C. Suresh

A dynamic joint replenishment policy with auto-correlated demand pp. 729-747

Loo Hay Lee and Ek Peng Chew

An inventory model for delayed customization: A hybrid approach pp. 748-764

Ronald S. Tibben-Lembke and Yehuda Bassok

Optimal stopping problem with double reservation value property pp. 765-785

Byung-Kook Kang

Minimal standby redundancy allocation in a k-out-of-n:F system of dependent components pp. 786-793

Vanderlei da Costa Bueno

Finite buffer polling models with routing pp. 794-809

Scott E. Grasman, Tava Lennon Olsen and John Birge

Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering pp. 810-825

Nihal Pekergin, Tugrul Dayar and Denizhan N. Alparslan

Robustness of Kriging when interpolating in random simulation with heterogeneous variances: Some experiments pp. 826-834

Jack Kleijnen and Wim C. M. van Beers

Technical note - On optimization approach for multidisk vertical allocation problems pp. 835-842

Jung-Fa Tsai and Han-Lin Li

On the single machine total tardiness problem pp. 843-846

Z. J. Tian, C. T. Ng and T. C. E. Cheng

Volume 165, issue 2, 2005

Project management and scheduling pp. 285-288

Vicente Valls and Jan Weglarz

Project scheduling under uncertainty: Survey and research potentials pp. 289-306

Willy Herroelen and Roel Leus

On the fallacy of averages in project risk management pp. 307-313

Salah E. Elmaghraby

Maximization of solution flexibility for robust shop scheduling pp. 314-328

Christian Artigues, Jean-Charles Billaut and Carl Esswein

Simple probability models for project contracting pp. 329-338

Anand Paul and Genaro Gutierrez

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem pp. 339-358

Can Akkan, Andreas Drexl and Alf Kimms

New computational results for the discrete time/cost trade-off problem with time-switch constraints pp. 359-374

Mario Vanhoucke

Justification and RCPSP: A technique that pays pp. 375-386

Vicente Valls, Francisco Ballestin and Sacramento Quintanilla

An introduction to multi-parameter complexity analysis of discrete problems pp. 387-397

S. V. Sevastianov

Complexity results for flow-shop problems with a single server pp. 398-407

Peter Brucker, Sigrid Knust and Guoqing Wang

The two-machine flow-shop problem with weighted late work criterion and common due date pp. 408-415

Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna and Frank Werner

Positive half-products and scheduling with controllable processing times pp. 416-422

Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak and Frank Werner

Single machine scheduling to minimize total weighted tardiness pp. 423-443

T. C. E. Cheng, C. T. Ng, J. J. Yuan and Z. H. Liu

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem pp. 444-456

T. C. Edwin Cheng and Natalia V. Shakhlevich

Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach pp. 457-467

M. Ghirardi and C. N. Potts

Scheduling UET-UCT outforests to minimize maximum lateness pp. 468-478

Gaurav Singh

A comprehensive review and evaluation of permutation flowshop heuristics pp. 479-494

Ruben Ruiz and Concepcion Maroto

Scheduling of continuous and discontinuous material flows with intermediate storage restrictions pp. 495-509

Klaus Neumann, Christoph Schwindt and Norbert Trautmann

Continuous filling and emptying of storage systems in constraint-based scheduling pp. 510-524

Francis Sourd and Jerome Rogerie

A heuristic to schedule flexible job-shop in a glass factory pp. 525-534

R. Alvarez-Valdes, A. Fuertes, J. M. Tamarit, G. Gimenez and R. Ramos

Evolutionary algorithms for periodic arc routing problems pp. 535-553

Philippe Lacomme, Christian Prins and Wahiba Ramdane-Cherif

Volume 165, issue 1, 2005

Location analysis: A synthesis and survey pp. 1-19

C. S. ReVelle and H. A. Eiselt

Minimizing total completion time and total deviation of job completion times from a restrictive due-date pp. 20-33

Gur Mosheiov

Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics pp. 34-54

Ruben Ruiz, Concepcion Maroto and Javier Alcaraz

Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem pp. 55-69

Thomas Dunker, Gunter Radons and Engelbert Westkamper

Improved results on the 0-1 multidimensional knapsack problem pp. 70-81

Michel Vasquez and Yannick Vimont

Optimal timing of a sequence of tasks with general completion costs pp. 82-96

Francis Sourd

The shortest path problem with forbidden paths pp. 97-107

Daniel Villeneuve and Guy Desaulniers

Optimal inventory policies for an economic order quantity model with decreasing cost functions pp. 108-126

Hoon Jung and Cerry M. Klein

Multi-product lot-sizing with a transportation capacity reservation contract pp. 127-138

Linda van Norden and Steef van de Velde

An experimental analysis of solution performance in a resource sharing and scheduling problem pp. 139-156

Subhashish Samaddar, Gad Rabinowitz and Guoqiang Peter Zhang

Global plant capacity and product allocation with pricing decisions pp. 157-181

Amiya K. Chakravarty

Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers pp. 182-206

Erdem Eskigun, Reha Uzsoy, Paul Preckel, George Beaujon, Subramanian Krishnan and Jeffrey D. Tew

Inventory pooling of repairable spare parts with non-zero lateral transshipment time and delayed lateral transshipments pp. 207-218

Hartanto Wong, Dirk Cattrysse and Dirk Van Oudheusden

Knowledge-based framework for automated dynamic supply chain configuration pp. 219-230

Selwyn Piramuthu

A two-bottleneck system with binomial yields and rigid demand pp. 231-250

Abraham Grosfeld-Nir

Incomplete information and multiple machine queueing problems pp. 251-266

Manipushpak Mitra

Index policies for the maintenance of a collection of machines by a set of repairmen pp. 267-284

K. D. Glazebrook, H. M. Mitchell and P. S. Ansell