Geodesic
Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity
RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 1, pp. 1-18

Voir la notice de l'article provenant de la source Numdam

We study a deterministic problem of evaluating the worst case performance of flexible solutions in the single machine scheduling. A flexible solution is a set of schedules following a given structure determined by a partial order of jobs and a type of the schedules. In this paper, the schedules of active and non-delay type are considered. A flexible solution can be used on-line to absorb the impact of data disturbances related to, for example, job arrival, tool availability or machine breakdowns. The performance of a flexible solution includes the best case and the worst case performances. The best case performance is an ideal performance that can be achieved only if the on-line conditions allow to implement the best schedule of the set of schedules characterizing the flexible solution. In contrast, the worst case performance indicates how poorly the flexible solution may perform when following the given structure in the on-line circumstances. The best-case and the worst-case performances are usually evaluated by the minimum and maximum values of the considered objective function, respectively. We present algorithmic and computational complexity results for some maximization scheduling problems. In these problems, the jobs to be scheduled have different release dates and precedence constraints may be given on the set of jobs.

DOI : 10.1051/ro:20070012
Keywords: scheduling, single machine, schedule flexibility, maximization problems, active and non-delay schedules 
@article{RO_2007__41_1_1_0,
     author = {Aloulou, Mohamed Ali and Kovalyov, Mikhail Y. and Portmann, Marie-Claude},
     title = {Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1--18},
     publisher = {EDP-Sciences},
     volume = {41},
     number = {1},
     year = {2007},
     doi = {10.1051/ro:20070012},
     mrnumber = {2310536},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:20070012/}
}
TY  - JOUR
AU  - Aloulou, Mohamed Ali
AU  - Kovalyov, Mikhail Y.
AU  - Portmann, Marie-Claude
TI  - Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2007
SP  - 1
EP  - 18
VL  - 41
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro:20070012/
DO  - 10.1051/ro:20070012
LA  - en
ID  - RO_2007__41_1_1_0
ER  - 
%0 Journal Article
%A Aloulou, Mohamed Ali
%A Kovalyov, Mikhail Y.
%A Portmann, Marie-Claude
%T Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2007
%P 1-18
%V 41
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro:20070012/
%R 10.1051/ro:20070012
%G en
%F RO_2007__41_1_1_0
Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude. Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity. RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 1, pp. 1-18. doi: 10.1051/ro:20070012

Cité par Sources :