Displaying similar documents to “Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine ”

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...

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 méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication

Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli (2010)

RAIRO - Operations Research

Similarity:

This paper deals with the problem of scheduling tasks on identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics. ...

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...

Comportement local moyen de la fonction de Brjuno

Michel Balazard, Bruno Martin (2012)

Fundamenta Mathematicae

Similarity:

We describe the average behaviour of the Brjuno function Φ in the neighbourhood of any given point of the unit interval. In particular, we show that the Lebesgue set of Φ is the set of Brjuno numbers and we find the asymptotic behaviour of the modulus of continuity of the integral of Φ.

Counterfactuals : the epistemic analysis

John-Michael Kuczynski (2005)

Philosophia Scientiae

Similarity:

En temps normal, les contrefactuels sont conçus comme produisant des énoncés portant sur des états de choses, mais des états de choses se trouvant dans des mondes simplement possibles ou alternes. Analysés ainsi, il s’avère que presque tous les contrefactuels sont incohérents. Tout contrefactuel analysé de la sorte exige qu’il y ait un monde métaphysiquement (et pas épistémiquement seulement) possible w où les lois sont les mêmes qu’ici, et où la quasi-totalité des faits sont les mêmes...