Show simple item record

dc.contributor.authorKacem, Imed
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2011-05-19T13:05:30Z
dc.date.available2011-05-19T13:05:30Z
dc.date.issued2013
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/6305
dc.language.isoenen
dc.subjectscheduling problemen
dc.subjectdifferential approximabilityen
dc.subject.ddc003en
dc.titleWeighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximabilityen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper is the first successful attempt on differential approximability study for a scheduling problem. Such a study considers the weighted completion time minimization on a single machine with a fixed non-availability interval. The analysis shows that the Weighted Shortest Processing Time (WSPT) rule cannot yield a differential approximation for the studied problem in the general case. Nevertheless, a slight modification of this rule provides an approximation with a differential ratio of 3−√5 2 ≈ 0.38.en
dc.relation.isversionofjnlnameDiscrete Optimization
dc.relation.isversionofjnlvol10
dc.relation.isversionofjnlissue1
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnlpages61-68
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.disopt.2012.11.002
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevier
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record