Abstract
We initiate the study of scheduling problems where the number or size of the gaps in the schedule is taken into consideration. We focus on the model with unit jobs. First we examine scheduling problems with release times and deadlines, where we consider variants of minimum-gap scheduling, including maximizing throughput with a budget for gaps or minimizing the number of gaps with a throughput requirement. We then turn to other objective functions. For example, in some scenarios, gaps in a schedule may be actually desirable, leading to the problem of maximizing the number of gaps. The second part of the paper examines the model without deadlines, where we focus on the tradeoff between the number of gaps and flow time.
For all these problems we provide polynomial algorithms. The solutions involve a spectrum of algorithmic techniques, including different dynamic programming formulations, speed-up techniques based on searching Monge arrays, searching \(X+Y\) matrices, or implicit binary search. Throughout the paper, we also draw a connection between our scheduling problems and their continuous analogues, namely hitting set problems for intervals of real numbers.
Research supported by NSF grants CCF-0729071 and CCF-1217314 and by grant FSGRF14EG28 (Hong Kong).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angel, E., Bampis, E., Chau, V.: Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 13–24. Springer, Heidelberg (2012)
Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 364–367 (2006)
Baptiste, P., Chrobak, M., Dürr, C.: Polynomial time algorithms for minimum energy scheduling. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 136–150. Springer, Heidelberg (2007)
Chrobak, M., Feige, U., Taghi Hajiaghayi, M., Khanna, S., Li, F., Naor, S.: A greedy approximation algorithm for minimum-gap scheduling. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 97–109. Springer, Heidelberg (2013)
Chrobak, M., Golin, M.J., Lam, T.-W., Nogneng, D.: Scheduling with gaps: New models and algorithms. CoRR, abs/1410.7092 (2014)
Demaine, E., Ghodsi, M., Hajiaghayi, M., Sayedi-Roshkhar, A., Zadimoghaddam, M.: Scheduling to minimize gaps and power consumption. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 46–54 (2007)
Irani, S., Pruhs, K.R.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)
Mirzaian, A., Arjomandi, E.: Selection in X+Y and matrices with sorted rows and columns. Inf. Process. Lett. 20(1), 13–17 (1985)
Wikipedia. Point coordination function. http://en.wikipedia.org/wiki/Point_coordination_function
Woeginger, G.: Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. 27(3), 93–96 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chrobak, M., Golin, M., Lam, TW., Nogneng, D. (2015). Scheduling with Gaps: New Models and Algorithms. In: Paschos, V., Widmayer, P. (eds) Algorithms and Complexity. CIAC 2015. Lecture Notes in Computer Science(), vol 9079. Springer, Cham. https://doi.org/10.1007/978-3-319-18173-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-18173-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18172-1
Online ISBN: 978-3-319-18173-8
eBook Packages: Computer ScienceComputer Science (R0)