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!

Schreiben Sie den ersten Kommentar!