Zhao, YingchaoYingchaoZhaoFong, K. C. K.Li, M.Li, Y.Poon, S.-H.Wu, W.2021-03-272021-03-272017https://repository.sfu.edu.hk/handle/sfu/441We study the following scheduling problem on a single processor. We are given <i>n</i> jobs, where each job j_i has an integer release time r_i, processing time p_i as well as deadline d_i. The processor can schedule an unlimited number of jobs at any time t. Our objective is to schedule the jobs together such that the total number of active time slots is minimized. We present an O( n³ ) dynamic programming algorithm for the case of agreeable deadlines with d_i ≤ d_j whenever r_i < r_j or all jobs are big. In the general case, we present an online algorithm with competitive ratio 4 and show that our analysis is tight.enconference proceedings