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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 607; s. 181 - 192
Hlavní autori:	Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 23.11.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!