Two-agent parallel-machine scheduling with rejection

We study the two-agent scheduling with rejection on two parallel machines. There are two competing agents A and B with job families JA and JB, respectively. A job in JA or JB is either rejected, in which case a rejection penalty will be incurred, or accepted and processed on one of the two parallel...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 703; pp. 66 - 75
Main Authors:	Li, Dawei, Lu, Xiwen
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 05.12.2017
Subjects:	Agent scheduling FPTAS Parallel machines Pseudo-polynomial time algorithm Rejection Rejection Parallel machines FPTAS Pseudo-polynomial time algorithm Agent scheduling
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!