Asia-Pacific Journal of Operational Research | 2021
A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Abstract
In this paper, a single-machine semi-online scheduling problem with rejection is addressed. In this model, “semi-online” implies that [Formula: see text], where [Formula: see text] and [Formula: see text] are the maximum processing time and the minimum one among all jobs, respectively, [Formula: see text]. In this setting, each job arrives online over time, and rejection is allowable. Our goal is minimizing the total penalty cost of rejected jobs plus the total completion time of processed jobs. The seminal result of this study is that we offer an algorithm with competitive ratio [Formula: see text], which matches the result of the problem without rejection.