Show simple item record

dc.contributor.authorKacem, I.
dc.contributor.authorHaouari, Mohamed
dc.date.accessioned2012-05-28T13:11:25Z
dc.date.available2012-05-28T13:11:25Z
dc.date.issued2009-03
dc.identifier.issn1619-4500
dc.identifier.urihttp://hdl.handle.net/10679/175
dc.identifier.urihttp://www.springerlink.com/content/x118pg4055027649/
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractIn this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage’s algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.en_US
dc.description.sponsorshipConseil Général Champagne-Ardenne
dc.language.isoengen_US
dc.publisherSpringer Natureen_US
dc.relation.ispartof4OR: A Quarterly Journal of Operations Research
dc.rightsrestrictedAccess
dc.titleApproximation algorithms for single machine scheduling with one unavailability perioden_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume7
dc.identifier.issue1
dc.identifier.startpage79
dc.identifier.endpage92
dc.identifier.wosWOS:000264830600007
dc.identifier.doi10.1007/s10288-008-0076-6
dc.subject.keywordsSchedulingen_US
dc.subject.keywordsSingle machineen_US
dc.subject.keywordsApproximationen_US
dc.subject.keywordsUnavailability constrainten_US
dc.identifier.scopusSCOPUS:2-s2.0-63949087368
dc.contributor.authorMale1


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


Share this page