Displaying similar documents to “Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication”

Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art

A. Vignier, J.-C. Billaut, C. Proust (2010)

RAIRO - Operations Research

Similarity:

A special class of scheduling problems is studied in this paper, named Hybrid Flowshop, jobs have to be performed in a shop and each of them has the same routing (so this is a flowshop). A job consists in different operations. A set of machines are able to perform each operation and this set is called a stage. So when a job consists in two operations, there are two stages in the shop. After introducing the scheduling generalities, we define our preocupations and we propose a notation in...

Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine

M.-L. Levy, P. Lopez, B. Pradin (2010)

RAIRO - Operations Research

Similarity:

We propose a temporal decomposition approach for the one-machine scheduling problem with ready times and due dates. A set of feasible schedules is characterized by means of constraint-based analysis rules. They permit the determination of the feasible locations of each task in a sequence, represented by rank intervals. A decomposition procedure based on comparisons of rank intervals is developed in order to group tasks to be sequenced in the neighbourhood of each other in a feasible...

Un ordonnancement dynamique de tâches stochastiques sur un seul processeur

Ali Derbala (2010)

RAIRO - Operations Research

Similarity:

We show that a particular dynamic priority given to jobs in a multitasks operating system of computers is a deteriorating jobs or a delaying jobs scheduling. Under some assumptions we also show that it is an index rule. To do this, we present the tool of bandit processes to solve stochastic scheduling problems on a single machine.

Une heuristique d'optimisation globale basée sur la -transformation

Alexandre Dolgui, Valery Sysoev (2010)

RAIRO - Operations Research

Similarity:

In this paper, we study a heuristic algorithm for global optimization, which is based on the -transformation. We illustrate its behavior first, on a set of continuous non-convex objective functions – we search the global optimum of each function. Then, we give an example from combinatorial optimization. It concerns the optimization of scheduling rules parameters of a manufacturing system. Computational results are presented, they look encouraging.

Coloration de graphes : fondements et applications

Dominique de Werra, Daniel Kobler (2010)

RAIRO - Operations Research

Similarity:

The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention...

Transfert de Charge dans un Réseau de Processeurs Totalement Connectés

Maryse Béguin (2010)

RAIRO - Operations Research

Similarity:

In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host tasks. The...

Un algorithme d'identification de frontières soumises à des conditions aux limites de Signorini

Slim Chaabane, Mohamed Jaoua (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

This work deals with a non linear inverse problem of reconstructing an unknown boundary , the boundary conditions prescribed on being of Signorini type, by using boundary measurements. The problem is turned into an optimal shape design one, by constructing a Kohn & Vogelius-like cost function, the only minimum of which is proved to be the unknown boundary. Furthermore, we prove that the derivative of this cost function with respect to a direction depends only on the state ...

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

Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech (2010)

RAIRO - Operations Research

Similarity:

In this paper, a discrete-event simulation model is coupled with a genetic algorithm to treat highly combinatorial scheduling problems encountered in a production campaign of a fine chemistry plant. The main constraints and features of fine chemistry have been taken into account in the development of the model, thus allowing a realistic evaluation of the objective function used in the stochastic optimization procedure. After a presentation of problem combinatorics, the coupling strategy...

État de l'art des méthodes “d'optimisation globale”

Gérard Berthiau, Patrick Siarry (2010)

RAIRO - Operations Research

Similarity:

We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this...

Correcteurs proportionnels-intégraux généralisés

Michel Fliess, Richard Marquez, Emmanuel Delaleau, Hebertt Sira–Ramírez (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

For constant linear systems we are introducing and , which permit to bypass the derivative term in the classic PID controllers and more generally the usual asymptotic observers. Our approach, which is mainly of algebraic flavour, is based on the module-theoretic framework for linear systems and on operational calculus in Mikusiński's setting. Several examples are discussed.