• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Thumbnail
Date
2009
Dewey
Programmation, logiciels, organisation des données
Sujet
FPTAS; Weighted flow-time; Non-availibility constraint; Approximation; Scheduling
Journal issue
Computers and Industrial Engineering
Volume
56
Number
4
Publication date
05-2009
Article pages
1708-1712
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.cie.2008.09.042
URI
https://basepub.dauphine.fr/handle/123456789/3020
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kacem, Imed
Mahjoub, Ali Ridha
Type
Article accepté pour publication ou publié
Abstract (EN)
In a recent paper [Theoretical Computer Science 363, 257–265], He, Zhong and Gu considered the non-resumable case of the scheduling problem with a fixed non-availability interval under the non-resumable scenario. They proposed a polynomial time approximation scheme (PTAS) to minimize the total completion time. In this paper, we propose a fully polynomial-time approximation scheme to minimize the total weighted completion time. The FPTAS has O(n2/ε2) time complexity, where n is the number of jobs and ε is the required error bound. The proposed FPTAS outperforms all the previous approximation algorithms designed for this problem and its running time is strongly polynomial.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.