Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
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 solution. Computational...
Deux problèmes d'ordonnancement en télécommunications par satellite
Direct solutions of M/G/1 priority queueing models
Disjonctions dans les ordonnancements
Distributed fuzzy decision making for production scheduling.
In production systems, input materials (educts) pass through multiple sequential stages until they become a product. The production stages consist of different machines with various dynamic characteristics. The coupling of those machines is a non-linear distributed system. With a distributed control system based on a multi-agent approach, the production system can achieve (almost) maximum output, where lot size and lot sequence are the most important control variables. In most production processes...