Show simple item record

dc.contributor.authorDella Croce, Federico
dc.contributor.authorAloulou, Mohamed Ali
dc.date.accessioned2010-01-09T10:30:39Z
dc.date.available2010-01-09T10:30:39Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2837
dc.language.isoenen
dc.subjectSchedulingen
dc.subjectScenario-based uncertaintyen
dc.subjectAbsolute robustnessen
dc.subject.ddc003en
dc.titleComplexity of single machine scheduling problems under scenario-based uncertaintyen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe present algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. We use here the so-called absolute robustness criterion to select among feasible solutions.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol36en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2008-05
dc.relation.isversionofjnlpages338-342en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2007.11.005en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record