Two-Agent Single Machine Scheduling with Deteriorating Jobs and Rejection

We consider two two-agent scheduling problems with deteriorating jobs and rejection. Two agents A and B compete for the usage of a single machine. The actual processing time of job JjX is pjX=bjXa+bt, X∈A,B, where bjX is the normal processing time of JjX, a≥0, b≥0 and t denotes the starting time of...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical problems in engineering Ročník 2022; s. 1 - 10
Hlavní autori:	Li, Dawei, Li, Ganggang, Cheng, Fangzheng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Hindawi 28.11.2022 John Wiley & Sons, Inc
Predmet:	Algorithms Approximation Completion time Dynamic programming Mathematical analysis Polynomials Rejection Schedules Scheduling Upper bounds
ISSN:	1024-123X, 1563-5147
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!