Back to Search
Start Over
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- Source :
-
Theoretical Computer Science . Feb2011, Vol. 412 Issue 4/5, p275-280. 6p. - Publication Year :
- 2011
-
Abstract
- Abstract: We consider a problem of scheduling resumable deteriorating jobs on a single machine with non-availability constraints. The objective is to minimize the total completion time. We prove that the problem with a single non-availability period is NP-hard in the ordinary sense and possesses a fully polynomial-time approximation scheme. In addition, we show that there does not exist a polynomial-time approximation algorithm with a constant worst-case ratio for the problem with two or more non-availability periods, unless . [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 412
- Issue :
- 4/5
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 57165050
- Full Text :
- https://doi.org/10.1016/j.tcs.2010.09.017