DMCA
Optimal Deadline Scheduling with Commitment
| Citations: | 7 - 2 self |
BibTeX
@MISC{Chen_optimaldeadline,
author = {Shiyao Chen and Lang Tong and Ting He},
title = {Optimal Deadline Scheduling with Commitment},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler’s decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is 3 − 2 √ 2 and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the charging of plug-in hybrid electrical vehicles (PHEV) at garages or parking lots. Index Terms—Deadline scheduling; competitive ratio analysis; commitment requirement; PHEV charging scheduling. I.
Keyphrases
optimal deadline scheduling commitment requirement direct application competitive ratio index term deadline scheduling competitive ratio analysis corresponding job accepted job arriving job unfinished workload scheduler decision plug-in hybrid electrical vehicle additional penalty simple online algorithm threshold admission optimal scheduling maximum competitive ratio overall profit online scheduler total value online preemptive scheduling problem
