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