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

Celý popis

Podrobná bibliografia

Vydané v:	Applied mathematical modelling Ročník 39; číslo 3-4; s. 1183 - 1193
Hlavní autori:	Feng, Qi, Fan, Baoqiang, Li, Shisheng, Shang, Weiping
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!