Thumbnail - Request a copy

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), Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers and Industrial Engineering, 56, 4, p. 1708-1712. http://dx.doi.org/10.1016/j.cie.2008.09.042

Type
Article accepté pour publication ou publié
Date
2009
Journal name
Computers and Industrial Engineering
Volume
56
Number
4
Publisher
Elsevier
Pages
1708-1712
Publication identifier
Metadata
Show full item record
Author(s)
Kacem, Imed cc
Mahjoub, Ali Ridha
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.
Subjects / Keywords
FPTAS; Weighted flow-time; Non-availibility constraint; Approximation; Scheduling