• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability

Kacem, Imed; Paschos, Vangelis (2013), Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability, Discrete Optimization, 10, 1, p. 61-68. http://dx.doi.org/10.1016/j.disopt.2012.11.002

View/Open
cahier305.PDF (193.3Kb)
Type
Article accepté pour publication ou publié
Date
2013
Journal name
Discrete Optimization
Volume
10
Number
1
Publisher
Elsevier
Pages
61-68
Publication identifier
http://dx.doi.org/10.1016/j.disopt.2012.11.002
Metadata
Show full item record
Author(s)
Kacem, Imed cc
Paschos, Vangelis
Abstract (EN)
This 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.
Subjects / Keywords
scheduling problem; differential approximability

Related items

Showing items related by title and author.

  • Thumbnail
    Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval 
    Kacem, Imed; Mahjoub, Ali Ridha (2009) Article accepté pour publication ou publié
  • Thumbnail
    Approximability preserving reductions for NP-complete problems 
    Paschos, Vangelis; Renotte, Laure (1995) Article accepté pour publication ou publié
  • Thumbnail
    New Results on Polynomial Inapproximability and Fixed Parameter Approximability of Edge Dominating Set 
    Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis; Xiao, Mingyu (2015) Article accepté pour publication ou publié
  • Thumbnail
    Weighted coloring: further complexity and approximability results 
    Paschos, Vangelis; Escoffier, Bruno; Monnot, Jérôme (2006) Article accepté pour publication ou publié
  • Thumbnail
    Weighted coloring: further complexity and approximability results 
    Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2005) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo