default search action
European Journal of Operational Research, Volume 120
Volume 120, Number 1, January 2000
- Leonard Fortuin, Mynt Zijlstra:
Operational research in practice: Consultancy in industry revisited. 1-13 - Jack P. C. Kleijnen, Robert G. Sargent:
A methodology for fitting and validating metamodels in simulation. 14-29 - Jonathan F. Bard, John Plummer, Jean Claude Sourie:
A bilevel programming approach to determining tax credits for biofuel production. 30-46 - Antonio Alonso-Ayuso, Laureano F. Escudero, M. Teresa Ortuño:
A stochastic 0-1 program based approach for the air traffic flow management problem. 47-62 - Ahmet Bolat:
Procedures for providing robust gate assignments for arriving aircrafts. 63-80 - Martin Lagerholm, Carsten Peterson, Bo Söderberg:
Airline crew scheduling using Potts mean field techniques. 81-96 - Duncan K. H. Fong, Virginia M. Gempesaw, J. Keith Ord:
Analysis of a dual sourcing inventory model with normal unit demand and Erlang mixture lead times. 97-107 - Markus Feurstein, Martin Natter:
Fast high precision decision rules for valuing manufacturing flexibility. 108-117 - Enver Yücesan, Xavier de Groote:
Lead times, order release mechanisms, and customer service. 118-130 - Mohamed Ben-Daya, M. A. Rahim:
Effect of maintenance on the economic design of x-control chart. 131-143 - Francisco Herrera, Enrique Herrera-Viedma:
Choice functions and mechanisms for linguistic preference relations. 144-161 - R. C. Van den Honert, Freerk A. Lootsma:
Assessing the quality of negotiated proposals using the REMBRANDT system. 162-173 - M. D. S. Aliyu:
A vertex algorithm for collision detection. 174-180 - Khaled S. Al-Sultan, M. F. S. Pulak:
Optimum target values for two machines in series with 100% inspection. 181-189 - Lilian M. de Menezes, Derek W. Bunn, James W. Taylor:
Review of guidelines for the use of combined forecasts. 190-204 - Fabio Mercurio, J. M. Moraleda:
An analytically tractable interest rate model with humped volatility. 205-214 - Oded Berman, Zvi Drezner:
A note on the location of an obnoxious facility on a network. 215-217
Volume 120, Number 2, January 2000
- Editorial. 223-227
- Chris N. Potts, Mikhail Y. Kovalyov:
Scheduling with batching: A review. 228-249 - Alex E. Gerodimos, Celia A. Glass, Chris N. Potts:
Scheduling the production of two-component jobs on a single machine. 250-259 - Yale T. Herer, Levi Shalom:
The Kanban assignment problem - A non-integral approach. 260-276 - Giuseppe Lancia:
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. 277-288 - Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Two linear approximation algorithms for the subset-sum problem. 289-296 - Ferdinando Pezzella, Emanuela Merelli:
A tabu search method guided by shifting bottleneck for the job shop scheduling problem. 297-310 - Herbert Meyr:
Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. 311-326 - Sigrid Lise Nonås, Anders Thorstenson:
A combined cutting-stock and lot-sizing problem. 327-342 - Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Complexity of mixed shop scheduling problems: A survey. 343-351 - Kristina Soric:
The CLWS heuristic for single machine scheduling problem. 352-358 - Ana Viana, Jorge Pinho de Sousa:
Using metaheuristics in multiobjective resource constrained project scheduling. 359-374 - Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei:
Minimizing tardy jobs in a flowshop with common due date. 375-381 - Fabrice Chauvet, Eugene Levner, Leonid K. Meyzin, Jean-Marie Proth:
On-line scheduling in a surface treatment system. 382-392 - Masatoshi Sakawa, Ryo Kubota:
Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. 393-407 - Robin Lovgren, Michael Racer:
Algorithms for mixed-model sequencing with due date restrictions. 408-422 - Lixin Tang, Jiyin Liu, Aiying Rong, Zihou Yang:
A mathematical programming model for scheduling steelmaking-continuous casting production. 423-435 - Girish Shambu, Nallan C. Suresh:
Performance of hybrid cellular manufacturing systems: A computer simulation investigation. 436-458
Volume 120, Number 3, February 2000
- Luciano Nieddu, Giacomo Patrizi:
Formal methods in pattern recognition: A review. 459-495 - Eero Kasanen, Hannele Wallenius, Jyrki Wallenius, Stanley Zionts:
A study of high-level managerial decision processes, with implications for MCDM research. 496-510 - Jian-Ming Li, Chin-I Chiang, Po-Lung Yu:
Optimal multiple stage expansion of competence set. 511-524 - Adi Raveh:
The Greek banking system: Reanalysis of performance. 525-534 - Peng-Sheng You:
Sequential buying policies. 535-544 - Jayashankar M. Swaminathan:
Tool capacity planning for semiconductor fabrication facilities under demand uncertainty. 545-558 - C. S. Sung, Y. I. Choung:
Minimizing makespan on a single burn-in oven in semiconductor manufacturing. 559-574 - Ruey-Huei Yeh, Wen-Tsung Ho, Sheng-Tsaing Tseng:
Optimal production run length for products sold with warranty. 575-582 - Moshe Dror, Mohamed Haouari, Jouhaina Chaouachi Siala:
Generalized spanning trees. 583-592 - David K. Smith, Godfrey A. Walters:
An evolutionary approach for finding optimal trees in undirected networks. 593-602 - Hsu-Hao Yang, Yen-Liang Chen:
Finding the critical path in an activity network with time-switch constraints. 603-613 - Jamie Ebery, Mohan Krishnamoorthy, Andreas T. Ernst, Natashia Boland:
The capacitated multiple allocation hub location problem: Formulations and algorithms. 614-631 - Leonidas Sakalauskas, Saulius Minkevicius:
On the law of the iterated logarithm in open queueing networks. 632-640 - Qi-Ming He:
Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue. 641-656 - Hon-Shiang Lau, Amy Hing Ling Lau, John F. Kottas:
A comparison of procedures for estimating the parent probability distribution from a given set of fractiles. 657-670
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.