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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1060; S. 115642
Hauptverfasser:	Guo, Yanjie, Luo, Wenchang, Lin, Guohui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 18.01.2026
Schlagworte:	Approximation algorithm Controllable scheduling Job rejection Makespan Single machine scheduling Controllable scheduling Makespan Approximation algorithm Single machine scheduling Job rejection
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!