Worst case performance evaluation of flexible solutions in single machine scheduling
Identifieur interne : 000B40 ( Crin/Checkpoint ); précédent : 000B39; suivant : 000B41Worst case performance evaluation of flexible solutions in single machine scheduling
Auteurs : Mohamed Ali Aloulou ; Marie-Claude Portmann ; Mikhail Y. KovalyovSource :
English descriptors
Abstract
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in single machine scheduling. A flexible solution is a set of schedules following a structure defined by a partial order of jobs and a type of schedules. here, we consider active and non-delay schedules. The proposed structure allows the decision maker to dispose of some flexibility (a set of schedules instead of one schedule) that 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 is a function of (i) the best case performance providing the decision maker a lower bound of the performance, (ii) the worst case performance giving him a guarantee about how poorly the solution may perform, in both cases when following the considered structure. The worst cases correspond to new scheduling problems, in which a regular criterion must be maximized. We present new algorithms and/or new computational complexity results, in presence of : one machine, different release dates, precedence constraints and various criteria to be maximized.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:aloulou03bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="411">Worst case performance evaluation of flexible solutions in single machine scheduling</title></titleStmt><publicationStmt><idno type="RBID">CRIN:aloulou03b</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003892</idno><idno type="wicri:Area/Crin/Curation">003892</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003892</idno><idno type="wicri:Area/Crin/Checkpoint">000B40</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000B40</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Worst case performance evaluation of flexible solutions in single machine scheduling</title><author><name sortKey="Aloulou, Mohamed Ali" sort="Aloulou, Mohamed Ali" uniqKey="Aloulou M" first="Mohamed Ali" last="Aloulou">Mohamed Ali Aloulou</name></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></author><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>maximization problems</term><term>scheduling</term><term>scheduling flexibility</term><term>single machine</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2647">In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in single machine scheduling. A flexible solution is a set of schedules following a structure defined by a partial order of jobs and a type of schedules. here, we consider active and non-delay schedules. The proposed structure allows the decision maker to dispose of some flexibility (a set of schedules instead of one schedule) that 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 is a function of (i) the best case performance providing the decision maker a lower bound of the performance, (ii) the worst case performance giving him a guarantee about how poorly the solution may perform, in both cases when following the considered structure. The worst cases correspond to new scheduling problems, in which a regular criterion must be maximized. We present new algorithms and/or new computational complexity results, in presence of : one machine, different release dates, precedence constraints and various criteria to be maximized.</div></front></TEI><BibTex type="inproceedings"><ref>aloulou03b</ref><crinnumber>A03-R-153</crinnumber><category>3</category><equipe>MACSI</equipe><author><e>Aloulou, Mohamed Ali</e><e>Portmann, Marie-Claude</e><e>Kovalyov, Mikhail Y.</e></author><title>Worst case performance evaluation of flexible solutions in single machine scheduling</title><booktitle>{Computing Engineering in Systems Applications - CESA'2003, Lille, France}</booktitle><year>2003</year><month>Jul</month><keywords><e>scheduling</e><e>single machine</e><e>scheduling flexibility</e><e>maximization problems</e></keywords><abstract>In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in single machine scheduling. A flexible solution is a set of schedules following a structure defined by a partial order of jobs and a type of schedules. here, we consider active and non-delay schedules. The proposed structure allows the decision maker to dispose of some flexibility (a set of schedules instead of one schedule) that 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 is a function of (i) the best case performance providing the decision maker a lower bound of the performance, (ii) the worst case performance giving him a guarantee about how poorly the solution may perform, in both cases when following the considered structure. The worst cases correspond to new scheduling problems, in which a regular criterion must be maximized. We present new algorithms and/or new computational complexity results, in presence of : one machine, different release dates, precedence constraints and various criteria to be maximized.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B40 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 000B40 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:aloulou03b
|texte= Worst case performance evaluation of flexible solutions in single machine scheduling
}}
| This area was generated with Dilib version V0.6.33. |  |