%0 Conference Proceedings
%T Stochastic & Distributed Anytime Task Scheduling
%+ Autonomous intelligent machine (MAIA)
%A Charpillet, François
%A Chadès, Iadine
%A Gallone, Jean-Michel
%Z Colloque avec actes et comité de lecture. internationale.
%< avec comité de lecture
%Z 98-R-395 || charpillet98c
%B Workshop of the 13th Biennial European Conference on Artificial Intelligence ECAI98, on Monitoring and control of real-time intelligent systems
%C Brighton, United Kingdom
%P 7 p
%8 1998
%D 1998
%K scheduling
%K mas
%K sma
%K mdp
%K ordonancement
%Z Computer Science [cs]/Other [cs.OH]Conference papers
%X Scheduling techniques have been intensively studied by several research communities and have been applied to a wide range of applications in computer and manufacturing environments. Most of the scheduling problems are NP-Hard. Therefore, heuristics and approximation algorithms must be used for large problems. Obviously these methods are of interest when they provide near optimal solutions and when computational complexity can be controlled. For this purpose, we have developed a method based on Hopfield Neural Network model. This approach permits to solve in an iterative way a scheduling problem, finding a solution through the minimization of an energy function. An interesting property of this approach is its capacity to trade-off the quality for computation time. Indeed, the convergence speed of the minimization process can be tuned by adapting several parameters that influence the quality of the results. By tuning these parameters, we can built a library of a set of run-time executions (contracts) of the Hopfield minimization process with different characteristics (quality, efficiency). We present in this paper two applications exploiting the advantage of having available anytime contract algorithms. The first application illustrates how the availability of a library of contract algorithms make it possible to build a solution to one machine scheduling problems within a delay that follows a stochastic distribution. The second application deals with unrelated parallel machines scheduling of non preemptive tasks.
%G English
%L inria-00098551
%U https://inria.hal.science/inria-00098551
%~ CNRS
%~ INRIA
%~ INPL
%~ IRISA
%~ INRIA-LORRAINE
%~ LORIA2
%~ INRIA-NANCY-GRAND-EST
%~ TESTALAIN1
%~ UNIV-LORRAINE
%~ INRIA2
%~ LORIA
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ INRIA-300009
%~ UR1-MATH-NUM