Name
Abstract | ||
|---|---|---|
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 toning 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 to build a solution of a one machine scheduling problem within a delay that follows a stochastic distribution. The second application deals with unrelated parallel machines scheduling of non preemptive tasks. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/TAI.1998.744855 | TENTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS |
Keywords | Field | DocType |
job shop scheduling,computer aided manufacturing,computational complexity,approximation algorithms,application software,minimization,scheduling problem,computer applications,np hard,minimisation,scheduling,stochastic processes | Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Nurse scheduling problem,Two-level scheduling,Genetic algorithm scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISSN | Citations | PageRank |
1082-3409 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| François Charpillet | 1 | 448 | 54.11 |
| Iadine Chades | 2 | 36 | 6.00 |
| Jean-Michel Gallone | 3 | 0 | 0.34 |