Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine

Levy, M.-L., Lopez, P., and Pradin, B.. "Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine ." RAIRO - Operations Research 33.2 (2010): 185-208. <http://eudml.org/doc/197800>.

@article{Levy2010,
abstract = { 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 results are reported so that the capability of our approach to prepare the problem for a solution computation, achieved either by a human operator or by an automatic solving procedure, can be evaluated. },
author = {Levy, M.-L., Lopez, P., Pradin, B.},
journal = {RAIRO - Operations Research},
keywords = {Scheduling; temporal decompositon; feasibility. ; scheduling; temporal decomposition; feasibility},
language = {fre},
month = {3},
number = {2},
pages = {185-208},
publisher = {EDP Sciences},
title = {Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine },
url = {http://eudml.org/doc/197800},
volume = {33},
year = {2010},
}

TY - JOUR
AU - Levy, M.-L.
AU - Lopez, P.
AU - Pradin, B.
TI - Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 2
SP - 185
EP - 208
AB - 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 results are reported so that the capability of our approach to prepare the problem for a solution computation, achieved either by a human operator or by an automatic solving procedure, can be evaluated.
LA - fre
KW - Scheduling; temporal decompositon; feasibility. ; scheduling; temporal decomposition; feasibility
UR - http://eudml.org/doc/197800
ER -