Single machine controllable scheduling with bounded makespan

In a controllable scheduling environment, the processing time of a job can be shortened by allocating extra resource at a cost, or the job can be declined for processing by paying a penalty. We investigate the single machine controllable scheduling to minimize the sum of the total resource consumpti...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1060; s. 115642
Hlavní autori:	Guo, Yanjie, Luo, Wenchang, Lin, Guohui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 18.01.2026
Predmet:	Approximation algorithm Controllable scheduling Job rejection Makespan Single machine scheduling Controllable scheduling Makespan Approximation algorithm Single machine scheduling Job rejection
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!