Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval

We consider two parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time, jobs can be rejected by paying penalties and the first machine has a fixed non-availability interval. The objective is to minimize the makespan of th...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 224; pp. 405 - 411
Main Authors Zhang, Minjiao, Luo, Chengxin
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.11.2013
Subjects
Approximation
Deteriorating jobs
Deterioration
Errors
FPTAS
Intervals
Maintenance interval
Mathematical analysis
Mathematical models
Parallel-machine scheduling
Rejection
Scheduling
Rejection
Maintenance interval
FPTAS
Deteriorating jobs
Parallel-machine scheduling
Online AccessGet full text

Cover

More Information
Summary:We consider two parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time, jobs can be rejected by paying penalties and the first machine has a fixed non-availability interval. The objective is to minimize the makespan of the accepted jobs plus the total penalty of the rejected jobs. We present a fully polynomial-time approximation scheme (FPTAS) for the case with two identical machines. The time complexity of the FPTAS is O(n6L4/ε3) where n is the number of jobs and L is the input size, ε is the error bound.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2013.07.003