default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Operations Research, Volume 33
Volume 33, Number 1, January 1999
- Éric D. Taillard:
A heuristic column generation method for the heterogeneous fleet VRP. 1-14 - Alain Bui, Marc Bui, Christian Lavault:
On the hierarchy of functioning rules in distributed computing. 15-27 - Huan Neng Chiu:
A good approximation of the inventory level in a (Q, r) perishable inventory system. 29-45 - Philippe Vallin:
Détermination d'une période économique robuste dans le cadre du modèle de Wilson. 47-67 - Abdelkrim Haqiq
, Noufissa Mikou:
Contrôle dynamique de flux dans un système d'attente avec panne. 69-86 - Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. 87-92 - Monique Becker, André-Luc Beylot, G. Damm, Wei-Ying Thang:
Automatic run-time choice for simulation length in mimesis. 93-115
Volume 33, Number 2, April 1999
- A. Vignier, Jean-Charles Billaut, Christian Proust:
Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art. 117-183 - Marie-Luce Levy, Pierre Lopez, Bernard Pradin:
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine. 185-208 - Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner:
On the application of insertion techniques for job shop problems with setup times. 209-245
Volume 33, Number 3, July 1999
- N. M. M. de Abreu, Tania Maia Querido, Paulo Oswaldo Boaventura Netto:
Redinv-SA: la simulated annealing for the quadratic assignment problem. 249-273 - Michael M. Kostreva, Wlodzimierz Ogryczak:
Linear optimization with multiple equitable criteria. 275-297 - Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech:
Un couplage entre un algorithme génétique et un modèle de simulation pour l'ordonnancement à court terme d'un atelier discontinu de chimie fine. 299-338 - Israël-César Lerman:
Comparing classification tree structures: a special case of comparing q-ary relations. 339-365 - Evripidis Bampis:
The complexity of short schedules for uet bipartite graphs. 367-370 - Jesus R. Artalejo, Antonio Gómez-Corral:
Computation of the limiting distribution in queueing systems with repeated attempts and disasters. 371-382
Volume 33, Number 4, October 1999
- Anass Nagih, Gérard Plateau:
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. 383-419 - Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
On the parallel complexity of the alternating Hamiltonian cycle problem. 421-437 - Mohamed Haouari, Thouraya Daouas:
Optimal scheduling of the 3-machine assembly-type flow shop. 439-445 - Regina Sandra Burachik, Alfredo N. Iusem:
A generalized proximal point algorithm for the nonlinear complementarity problem. 447-479 - Marc Demange, Vangelis Th. Paschos:
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. 481-507 - Chi-Kwong Li, Wing-Keung Wong:
Extension of stochastic dominance theory to random variables. 509-524 - Y. Bencheikh:
Classification croisée et modèles. 525-541 - Bertrand Munier, Nathalie Taverdet-Popiolek:
Choix multicritères dans le risque et variables multidimensionnelles: proposition de méthode et application aux réseaux de transport d'énergie. 543-568 - Farid Beninel:
Dissimilarites de type spherique et positionnement multidimensionnel normé. 569-581
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.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
