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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 607; pp. 181 - 192
Main Authors:	Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 23.11.2015
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!