Back to Search
Start Over
Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval.
- Source :
- Journal of Applied Mathematics & Computing; Jun2015, Vol. 48 Issue 1/2, p585-605, 21p
- Publication Year :
- 2015
-
Abstract
- This paper studies single machine scheduling with a fixed non-availability interval. The processing time of a job is a linear increasing function of its starting time, and each job has a release date. A job is either rejected by paying a penalty cost or accepted and processed on the machine. The objective is to minimize the makespan of the accepted jobs and the total rejection penalties of the rejected jobs. We present a fully polynomial-time approximation scheme for the problem. We also show that the special case without non-availability interval can be solved using the same method with a lower order. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15985865
- Volume :
- 48
- Issue :
- 1/2
- Database :
- Complementary Index
- Journal :
- Journal of Applied Mathematics & Computing
- Publication Type :
- Academic Journal
- Accession number :
- 102439917
- Full Text :
- https://doi.org/10.1007/s12190-014-0820-3