Two-agent scheduling with rejection on a single machine

In this paper, we consider the two-agent scheduling problem with rejection on a single machine. In the problem we have two agents A and B with job families JA and JB, respectively. A job in JA or JB is either accepted and processed on the machine, or rejected with a certain rejection penalty having...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematical modelling Jg. 39; H. 3-4; S. 1183 - 1193
Hauptverfasser:	Feng, Qi, Fan, Baoqiang, Li, Shisheng, Shang, Weiping
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.02.2015
Schlagworte:	Agent scheduling Approximation algorithm Pseudo-polynomial-time algorithm Rejection Single machine Rejection Approximation algorithm Pseudo-polynomial-time algorithm Single machine Agent scheduling
ISSN:	0307-904X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!