default search action
European Journal of Operational Research, Volume 126
Volume 126, Number 1, October 2000
- Alain Hertz, Daniel Kobler:
A framework for the description of evolutionary algorithms. 1-12 - Huey-Kuo Chen, Ginny Feng:
Heuristics for the stochastic/dynamic user-optimal route choice problem. 13-30 - Anulark Pinnoi, Wilbert E. Wilhelm:
Valid inequalities for a class of assembly system problems. 31-50 - Fuh-Hwa Franklin Liu, Chueng-Chiu Huang, Yu-Lee Yen:
Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs. 51-68 - Péter Kas, Emil Klafszky, Levente Mályusz, Gökhan Izbirak:
Approximation of linear programs by Bregman's DF projections. 69-79 - K. J. Becker, Donald P. Gaver, Kevin D. Glazebrook, Patricia A. Jacobs, Siriphong Lawphongpanich:
Allocation of tasks to specialized processors: A planning approach. 80-88 - Manuel Tarrazo, Luis Gutierrez:
Economic expectations, fuzzy sets and financial planning. 89-105 - Keld Helsgaun:
An effective implementation of the Lin-Kernighan traveling salesman heuristic. 106-130 - Wenny H. M. Raaymakers, J. A. Hoogeveen:
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. 131-151 - Rudolf Vetschera:
A multi-criteria agency model with incomplete preference information. 152-165 - Domingo Morales, Francisco Almeida, F. García, José L. Roda, Casiano Rodríguez:
Design of parallel algorithms for the single resource allocation problem. 166-174 - Merja Halme, Pekka J. Korhonen:
Restricting weights in value efficiency analysis. 175-188 - K. Ravi Kumar, Arvinder P. S. Loomba, George C. Hadjinicola:
Marketing-production coordination in channels of distribution. 189-217 - Isao Shiromaru, Masahiro Inuiguchi, Masatoshi Sakawa:
A fuzzy satisficing method for electric power plant coal purchase using genetic algorithms. 218-230
Volume 126, Number 2, October 2000
- Erol Gelenbe:
The first decade of G-networks. 231-232 - Jesus R. Artalejo:
G-networks: A versatile approach for work removal in queueing networks. 233-249 - Jean-Michel Fourneau, Leïla Kloul, Dominique Verchère:
Multiple class G-networks with list-oriented deletions. 250-272 - Peter G. Harrison, Naresh M. Patel, Edwige Pitel:
Reliability modelling using G-queues. 273-287 - Ugur Halici:
Reinforcement learning with internal expectation for the random neural network. 288-307 - Erol Gelenbe, Hadas Shachnai:
On G-networks and resource allocation in multimedia systems. 308-318 - Hakan Bakircioglu, Taskin Koçak:
Survey of random neural network applications. 319-330 - Aristidis Likas, Andreas Stafylopatis:
Training the random neural network using quasi-Newton methods. 331-339 - Loris Faina:
A global optimization algorithm for the three-dimensional packing problem. 340-354 - Mohsen ElHafsi:
An operational decision model for lead-time and price quotation in congested manufacturing systems. 355-370 - Yunzeng Wang, Yigal Gerchak:
Input control in a batch production system with lead times, due dates and random yields. 371-385 - Boyan Metev, Dessislava Gueorguieva:
A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems. 386-390 - Jos F. Sturm, Shuzhong Zhang:
On weighted centers for semidefinite programming. 391-407 - Andreas Klose:
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. 408-421 - Christian Timpe, Josef Kallrath:
Optimal planning in large multi-site production networks. 422-435 - Emmanuel Thanassoulis:
The use of data envelopment analysis in the regulation of UK water utilities: Water distribution. 436-453 - Manoel B. Campêlo, Susana Scheimberg:
A note on a modified simplex approach for solving bilevel linear programming problems. 454-458
Volume 126, Number 3, November 2000
- Chung-Hsing Yeh, Hepu Deng, Yu-Hern Chang:
Fuzzy multicriteria analysis for performance evaluation of bus companies. 459-473 - Ahmed W. El-Bouri, Subramaniam Balakrishnan, Neil Popplewell:
Sequencing jobs on a single machine: A neural network approach. 474-490 - Jia-Ming Cao, Adib Kanafani:
The value of runway time slots for airlines. 491-500 - James Odeck:
Assessing the relative efficiency and productivity growth of vehicle inspection services: An application of DEA and Malmquist indices. 501-514 - Gang Hao, Quanling Wei, Hong Yan:
The generalized DEA model and the convex cone constrained game. 515-525 - Vadlamani Ravi, P. J. Reddy, Hans-Jürgen Zimmermann:
Pattern classification with principal component analysis and fuzzy rule bases. 526-533 - Dong Shang Chang:
Optimal burn-in decision for products with an unimodal failure rate function. 534-540 - Jian-Bo Yang:
Minimax reference point approach and its application for multiobjective optimisation. 541-556 - Aleksander Bachman, Adam Janiak:
Minimizing maximum lateness under linear deterioration. 557-566 - Ihsan Sabuncuoglu, M. Bayiz:
Analysis of reactive scheduling problems in a job shop environment. 567-586 - Percy H. Brill, Myron Hlynka:
An exponential queue with competition for service. 587-602 - Guillermo Gallego, Alan Scheller-Wolf:
Capacitated inventory problems with fixed order costs: Some optimal policy structure. 603-613 - Craig W. Schmidt, Ignacio E. Grossmann:
The exact overall time distribution of a project with uncertain task durations. 614-636 - Hsiao-Fan Wang, Ruey-Chyn Tsaur:
Resolution of fuzzy regression model. 637-650 - Jeffrey L. Ringuest, Samuel B. Graves:
A sampling-based method for generating nondominated solutions in stochastic MOMP problems. 651-661 - Haldun Aytug, Gary J. Koehler:
New stopping criterion for genetic algorithms. 662-674 - Shashi Kant Mishra:
Multiobjective second order symmetric duality with cone constraints. 675-682 - Z. Xu:
On consistency of the weighted geometric mean complex judgement matrix in AHP. 683-687 - Wolfgang Brüggemann, Hermann Jahnke:
Erratum to 'The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability' [EJOR 124 (3) (2000) 511-528]. 688
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.