Abstract
In this paper, we work on the scheduling problem with active time model. We have a set of preemptive jobs with integral release times, deadlines and required processing lengths, while the preemption of jobs is only allowed at integral time points. We have a single machine that can process at most g distinct job units at any given time unit when the machine is switched on. The objective is to find a schedule that completes all jobs within their timing constraints and minimizes the time when the machine is on, i.e., the active time. This problem has been studied by Chang et al. where they proposed an LP rounding approach which gives a 2-approximation solution. In this paper, we also give a 2-approximation algorithm based on LP rounding approach with a different rounding technique and analysis. Finally, we give a new linear programming formulation for which we conjecture that the integrality gap is 5/3, which might bring new hope for beating the barrier of 2 for the approximation ratio.
Similar content being viewed by others
Notes
It is necessary that the time interval of a time slot is defined to be a half-open interval, i.e., (, ].
The endpoints of interval I are not restricted to be integers.
References
Amur, H., Cipar, J., Gupta, V., Ganger, G. R., Kozuch, M. A., & Schwan, K. (2010). Robust and flexible power-proportional storage. In Proceedings of the 1st ACM symposium on cloud computing (pp. 217–228). ACM.
Calinescu, G., Fu, C., Li, M., Wang, K., & Xue, C. J. (2018). Energy optimal task scheduling with normally-off local memory and sleep-aware shared memory with access conflict. IEEE Transactions on Computers, 1, 1–1.
Chang, Jessica, Gabow, Harold N., & Khuller, Samir. (2014). A model for minimizing active processor time. Algorithmica, 70(3), 368–405.
Chang, Jessica, Khuller, Samir, & Mukherjee, Koyel. (2017). LP rounding and combinatorial algorithms for minimizing active and busy time. Journal of Scheduling, 20(6), 657–680.
Ford, Lester Randolph, & Fulkerson, Delbert R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.
Kumar, S., & Khuller, S. (2018). Brief announcement: A greedy 2 approximation for the active time problem.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Cǎlinescu, G., Wang, K. A new LP rounding algorithm for the active time problem. J Sched 24, 543–552 (2021). https://doi.org/10.1007/s10951-020-00676-1
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-020-00676-1