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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1060; p. 115642
Main Authors:	Guo, Yanjie, Luo, Wenchang, Lin, Guohui
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 18.01.2026
Subjects:	Approximation algorithm Controllable scheduling Job rejection Makespan Single machine scheduling Controllable scheduling Makespan Approximation algorithm Single machine scheduling Job rejection
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!