Penalty cost constrained identical parallel machine scheduling problem

We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The ob...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 607; S. 181 - 192
Hauptverfasser: Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 23.11.2015
Schlagworte:
Algorithms
Approximation
Approximation algorithms
Constants
Fully polynomial time approximation scheme
Mathematical analysis
Polynomial time approximation scheme
Polynomials
Rejection
Rejection penalty
Running
Scheduling
Fully polynomial time approximation scheme
Approximation algorithms
Polynomial time approximation scheme
Scheduling
Rejection penalty
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The objective of the problem is to partition the set of jobs into two subsets, the subset of accepted and the subset of rejected jobs, and to schedule the set of accepted jobs such that the makespan is minimized under the constraint that the total penalty of the rejected jobs is no more than a given bound. In this paper, we present a 2-approximation algorithm within strongly polynomial time for the problem. We also present a polynomial time approximation scheme whose running time is O(nmO(1ϵ2)+mn2) for the problem. Moreover, for the case where the number of machines is a fixed constant m, our results lead to a fully polynomial time approximation scheme for the problem. Our result is fairly good in the sense that in a reasonable size of jobs, our FPTAS improves previous best running time from O(nm+2/ϵm) to O(1/ϵ2m+3+mn2).
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.10.007