{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:29Z","timestamp":1783576949423,"version":"3.55.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030416713","type":"print"},{"value":"9783030416720","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_13","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:03:04Z","timestamp":1582182184000},"page":"219-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Active and Busy Time Scheduling Problem: A Survey"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3362-2063","authenticated-orcid":false,"given":"Vincent","family":"Chau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-6237","authenticated-orcid":false,"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-39658-1_5","volume-title":"Algorithms - ESA 2003","author":"M Alicherry","year":"2003","unstructured":"Alicherry, M., Bhatia, R.: Line system design and a generalized coloring problem. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 19\u201330. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_5"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Amur, H., Cipar, J., Gupta, V., Ganger, G.R., Kozuch, M.A., Schwan, K.: Robust and flexible power-proportional storage. In: Proceedings of the 1st ACM Symposium on Cloud Computing, pp. 217\u2013228. ACM (2010)","DOI":"10.1145\/1807128.1807164"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-44914-2_1","volume-title":"Discrete Optimization and Operations Research","author":"E Bampis","year":"2016","unstructured":"Bampis, E.: Algorithmic issues in energy-efficient computation. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 3\u201314. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_1"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"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 Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 364\u2013367. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109598"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-013-9807-y","volume":"70","author":"J Chang","year":"2014","unstructured":"Chang, J., Gabow, H.N., Khuller, S.: A model for minimizing active processor time. Algorithmica 70(3), 368\u2013405 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9807-y","journal-title":"Algorithmica"},{"issue":"6","key":"13_CR6","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10951-017-0531-3","volume":"20","author":"J Chang","year":"2017","unstructured":"Chang, J., Khuller, S., Mukherjee, K.: Lp rounding and combinatorial algorithms for minimizing active and busy time. J. Sched. 20(6), 657\u2013680 (2017)","journal-title":"J. Sched."},{"issue":"3","key":"13_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S Chen","year":"2010","unstructured":"Chen, S., Ljubi\u0107, I., Raghavan, S.: The regenerator location problem. Netw.: Int. J. 55(3), 205\u2013220 (2010)","journal-title":"Netw.: Int. J."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/TNET.2010.2068309","volume":"19","author":"M Flammini","year":"2011","unstructured":"Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEE\/ACM Trans. Netw. (TON) 19(2), 498\u2013511 (2011)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"40\u201342","key":"13_CR9","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M Flammini","year":"2010","unstructured":"Flammini, M., et al.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40\u201342), 3553\u20133562 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-55911-7_18","volume-title":"Theory and Applications of Models of Computation","author":"KCK Fong","year":"2017","unstructured":"Fong, K.C.K., Li, M., Li, Y., Poon, S.-H., Wu, W., Zhao, Y.: Scheduling tasks to minimize active time on a processor with unlimited capacity. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 247\u2013259. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55911-7_18"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-015-0463-8","volume":"19","author":"ME Gerards","year":"2016","unstructured":"Gerards, M.E., Hurink, J.L., H\u00f6lzenspies, P.K.: A survey of offline algorithms for energy minimization under deadline constraints. J. sched. 19(1), 3\u201319 (2016)","journal-title":"J. sched."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani, S., Pruhs, K.R.: Algorithmic problems in power management. ACM Sigact News 36(2), 63\u201376 (2005)","journal-title":"ACM Sigact News"},{"key":"13_CR13","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2010)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-40104-6_41","volume-title":"Algorithms and Data Structures","author":"F Koehler","year":"2013","unstructured":"Koehler, F., Khuller, S.: Optimal batch schedules for parallel machines. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 475\u2013486. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_41"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-62127-2_44","volume-title":"Algorithms and Data Structures","author":"F Koehler","year":"2017","unstructured":"Koehler, F., Khuller, S.: Busy Time scheduling on a bounded number of machines (Extended Abstract). Algorithms and Data Structures. LNCS, vol. 10389, pp. 521\u2013532. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_44"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kumar, S., Khuller, S.: Brief announcement: a greedy 2 approximation for the active time problem. In: SPAA, pp. 347\u2013349 (2018)","DOI":"10.1145\/3210377.3210659"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11590156_12","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"V Kumar","year":"2005","unstructured":"Kumar, V., Rudra, A.: Approximation algorithms for wavelength assignment. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 152\u2013163. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_12"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.tcs.2014.10.033","volume":"562","author":"GB Mertzios","year":"2015","unstructured":"Mertzios, G.B., Shalom, M., Voloshin, A., Wong, P.W., Zaks, S.: Optimizing busy time on parallel machines. Theor. Comput. Sci. 562, 524\u2013541 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Oprescu, A.M., Kielmann, T.: Bag-of-tasks scheduling under budget constraints. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp. 351\u2013359. IEEE (2010)","DOI":"10.1109\/CloudCom.2010.32"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Ren, R., Tang, X.: Online flexible job scheduling for minimum span. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 55\u201366. ACM (2017)","DOI":"10.1145\/3087556.3087562"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Saradhi, C.V., et al.: A framework for regenerator site selection based on multiple paths. In: 2010 Conference on Optical Fiber Communication (OFC\/NFOEC), Collocated National Fiber Optic Engineers Conference, pp. 1\u20133. IEEE (2010)","DOI":"10.1364\/OFC.2010.OTuG7"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2014.07.017","volume":"560","author":"M Shalom","year":"2014","unstructured":"Shalom, M., Voloshin, A., Wong, P.W., Yung, F.C., Zaks, S.: Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560, 190\u2013206 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Shi, W., Hong, B.: Resource allocation with a budget constraint for computing independent tasks in the cloud. In: 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp. 327\u2013334. IEEE (2010)","DOI":"10.1109\/CloudCom.2010.54"},{"key":"13_CR24","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 830\u2013831. Society for Industrial and Applied Mathematics (2003)"}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T06:23:44Z","timestamp":1695795824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}