Skip to Main content Skip to Navigation

De l'ordonnancement déterministe à l'ordannancement distribué sous incertitudes

Samia Ourari 1
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : This work presents the study of two scheduling problems. The former concerns the exact and centralised resolution of a single machine problem, and the latter, the distributed and cooperative resolution of a job shop, each machine being viewed as an actor having its own decision autonomy. For both problems, dominance conditions are used, in the first case, in order to reduce the algorithmic complexity for seeking feasible or optimal solutions, and in the second case, to increase the ability of each actor to face uncertainties. In the _rst part, a theorem, stated in the early eighties, is recalled that allows to characterize a set of dominant solutions, considering a one-machine sequencing problem. On the basis of the theorem, new analytical and numerical dominance conditions are established that allow to tighten the set of dominant sequences. Then original and efficient mathematical formulations, in the form of integer linear programs, are proposed for modelling and solving single machine problems. Two kinds of criterion are considered : the minimization of the maximum lateness and the minimization of the number of tardy jobs. In the second part, the job shop scheduling problem is studied, using a multi-actor framework, assuming that each actor manages one machine. Taking into account the decisional autonomy and the own objectives of each actor, scheduling is seen as a distributed and dynamic function, where the global solution emerges from negotiations among the actors. We assume that each actor builds up its own local organisation in a robust way, having an imprecise and partial knowledge of the other actor's organisation. We particularly show how maintaining on each actor a set of dominant job sequences so that the worst performance can be bounded. Then a new scheduling approach is sketched where actors initiate point-to-point negotiation, in a distributed way, so as to progressively converge toward trade-off decisions that balance local and global objectives.
Document type :
Complete list of metadatas

Cited literature [138 references]  Display  Hide  Download
Contributor : Arlette Evrard <>
Submitted on : Thursday, June 9, 2011 - 9:53:48 AM
Last modification on : Friday, January 10, 2020 - 9:10:08 PM
Long-term archiving on: : Friday, November 9, 2012 - 2:55:45 PM


  • HAL Id : tel-00599267, version 1


Samia Ourari. De l'ordonnancement déterministe à l'ordannancement distribué sous incertitudes. Automatique / Robotique. Université Paul Sabatier - Toulouse III, 2011. Français. ⟨tel-00599267⟩



Record views


Files downloads