European Journal of Operational Research, Volume 149

Volume 149, Number 1, August 2003

• István Maros:
  A generalized dual phase-2 simplex algorithm. 1-16
  
• John Buchanan, Lorraine R. Gardiner:
  A comparison of two reference point methods in multiple objective mathematical programming. 17-34
  
• Chi-Jen Lin, Ue-Pyng Wen:
  Sensitivity analysis of the optimal assignment. 35-46
  
• Shogo Shiode, Zvi Drezner:
  A competitive facility location problem on a tree network with stochastic weights. 47-52
  
• C. Caruso, A. Colorni, L. Aloi:
  Dominant, an algorithm for the p-center problem. 53-64
  
• Laureano F. Escudero, S. Muñoz:
  On identifying dominant cliques. 65-76
  
• Andrés L. Medaglia, Shu-Cherng Fang:
  A genetic-based framework for solving (multi-criteria) weighted matching problems. 77-101
  
• Shantanu Bhattacharya, V. Krishnan, Vijay Mahajan:
  Operationalizing technology improvements in product development decision-making. 102-130
  
• Chih-Hsiung Wang, Shey-Huei Sheu:
  Optimal lot sizing for products sold under free-repair warranty. 131-141
  
• Junfang Yu, Bhaba R. Sarker:
  Directional decomposition heuristic for a linear machine-cell location problem. 142-184
  
• Ilaria Giannoccaro, Pierpaolo Pontrandolfo, Barbara Scozzi:
  A fuzzy echelon approach for inventory management in supply chains. 185-196
  
• Kwei Tang, Linguo Gong, Dong Shang Chang:
  Optimal process control policies under a time-varying cost structure. 197-210
  
• Hosun Rhim, Teck H. Ho, Uday S. Karmarkar:
  Competitive location, production, and market selection. 211-228
  
• Chi Chiang:
  Optimal replenishment for a periodic review inventory system with two supply modes. 229-244
  
• Denis Bouyssou:
  Data Envelopment Analysis, A comprehensive text with models, applications, references and DEA-solver software, W.W. Cooper, L.M. Seiford and K. Tone; Kluwer, 1999, ISBN 0-7923-8693-0, 318 pages. 245-246
  

Volume 149, Number 2, September 2003

• Peter Brucker, Sigrid Knust:
  Sequencing and scheduling. 247-248
  
• Christian Artigues, Philippe Michelon, Stéphane Reusser:
  Insertion techniques for static and dynamic resource-constrained project scheduling. 249-267
  
• K. Bouleimen, H. Lecocq:
  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. 268-281
  
• Vicente Valls, Sacramento Quintanilla, Francisco Ballestín:
  Resource-constrained project scheduling: A critical activity reordering heuristic. 282-301
  
• Peter Brucker, Sigrid Knust:
  Lower bounds for resource-constrained project scheduling problems. 302-313
  
• Jacques Carlier, Emmanuel Néron:
  On linear lower bounds for the resource constrained project scheduling problem. 314-324
  
• Klaus Neumann, Christoph Schwindt, J. Zimmermann:
  Order-based neighborhoods for project scheduling with nonregular objective functions. 325-343
  
• Philippe Baptiste:
  On minimizing the weighted number of late jobs in unit execution time open-shops. 344-354
  
• Vadim G. Timkovsky:
  Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. 355-376
  
• Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Przemyslaw Maczka:
  Scheduling multiprocessor tasks on parallel processors with limited availability. 377-389
  
• Ceyda Oguz, Muhammet Fikret Ercan, T. C. Edwin Cheng, Yu-Fai Fung:
  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. 390-403
  
• Yakov Zinder:
  An iterative algorithm for scheduling UET tasks with due dates and release times. 404-416
  
• Selçuk Karabati, Serpil Sayin:
  Assembly line balancing in a mixed-model sequencing environment with synchronous transfers. 417-429
  
• James M. Wilson:
  Gantt charts: A centenary appreciation. 430-437
  
• Sven Axsäter:
  Evaluation of unidirectional lateral transshipments and substitutions in inventory systems. 438-447
  
• Konstantin Kogan, Sheldon X. C. Lou:
  Multi-stage newsboy problem: A dynamic model. 448-458
  
• Süleyman Özekici, Refik Soyer:
  Reliability of software with an operational profile. 459-474
  

Volume 149, Number 3, September 2003

• Hoang Pham:
  Software reliability and cost models: Perspectives, comparison, and practice. 475-489
  
• Martine Labbé, Gilbert Laporte, Silvano Martello:
  Upper bounds and algorithms for the maximum cardinality bin packing problem. 490-498
  
• Haoxun Chen, Peter B. Luh:
  An alternative framework to Lagrangian relaxation approach for job shop scheduling. 499-512
  
• Chandrasekharan Rajendran, Hans Ziegler:
  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. 513-522
  
• Oguzhan Alagöz, Meral Azizoglu:
  Rescheduling of identical parallel machines under machine eligibility constraints. 523-532
  
• Vladimir G. Deineko, Gerhard J. Woeginger:
  Complexity and approximability results for slicing floorplan designs. 533-539
  
• Geraldo Ferrer:
  Yield information and supplier responsiveness in remanufacturing operations. 540-556
  
• Paul A. Rubin, W. C. Benton:
  Evaluating jointly constrained order quantity complexities for incremental discounts. 557-570
  
• S. Viswanathan, Qinan Wang:
  Discount pricing decisions in distribution channels with price-sensitive demand. 571-587
  
• Oren Nakdimon, Uri Yechiali:
  Polling systems with breakdowns and repairs. 588-613
  
• Zhang Wu, Hua Luo:
  Three-triplet np control charts. 614-624
  
• Antonis Economou, Demetrios Fakinos:
  A continuous-time Markov chain under the influence of a regulating point process and applications in stochastic models with catastrophes. 625-640
  
• Miguel Adán, V. Novo:
  Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. 641-653
  
• C. Stanciulescu, Philippe Fortemps, M. Installé, Vincent Wertz:
  Multiobjective fuzzy linear programming problems with fuzzy decision variables. 654-675
  
• Francesc Carreras, Josep Freixas, María Albina Puente:
  Semivalues as power indices. 676-687
  
• Tarja Joro, Pekka Korhonen, Stanley Zionts:
  An interactive approach to improve estimates of value efficiency in data envelopment analysis. 688-699