{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:47:19Z","timestamp":1742924839264,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_43","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"448-460","source":"Crossref","is-referenced-by-count":11,"title":["Online Optimization of Busy Time on Parallel Machines"],"prefix":"10.1007","author":[{"given":"Mordechai","family":"Shalom","sequence":"first","affiliation":[]},{"given":"Ariella","family":"Voloshin","sequence":"additional","affiliation":[]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Fencol C. C.","family":"Yung","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 1\u201323 (2000)","DOI":"10.1145\/335305.335410"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/3-540-45061-0_59","volume-title":"Automata, Languages and Programming","author":"R. Bhatia","year":"2003","unstructured":"Bhatia, R., Chuzhoy, J., Freund, A., Naor, J.: Algorithmic Aspects of Bandwidth Trading. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 751\u2013766. Springer, Heidelberg (2003)"},{"key":"43_CR3","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"43_CR4","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer (2007)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-47867-1_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2002","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H., Rabani, Y.: Improved Approximation Algorithms for Resource Allocation. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 401\u2013414. Springer, Heidelberg (2002)"},{"key":"43_CR6","first-page":"501","volume":"34","author":"B. Chen","year":"2002","unstructured":"Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Transactions\u00a034, 501\u2013507 (2002)","journal-title":"IIE Transactions"},{"issue":"3","key":"43_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S. Chen","year":"2010","unstructured":"Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks\u00a055(3), 205\u2013220 (2010)","journal-title":"Networks"},{"key":"43_CR8","unstructured":"J.Y.-T.L. (ed.): Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRS Press (2004)"},{"key":"43_CR9","unstructured":"Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A framework for regenerator site selection based on multiple paths. In: OFC, pp. 1\u20133 (2010)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. In: SPAA, pp. 154\u2013162 (2009); IEEE\/ACM Transactions on Networking","DOI":"10.1145\/1583991.1584035"},{"issue":"40-42","key":"43_CR11","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., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci.\u00a0411(40-42), 3553\u20133562 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/978-3-540-85451-7_99","volume-title":"Euro-Par 2008 Parallel Processing","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. In: Luque, E., Margalef, T., Ben\u00edtez, D. (eds.) Euro-Par 2008. LNCS, vol.\u00a05168, pp. 920\u2013929. Springer, Heidelberg (2008)"},{"key":"43_CR13","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: FSTTCS, pp. 169\u2013180 (2010)"},{"issue":"5","key":"43_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"A.W. Kolen","year":"2007","unstructured":"Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics (NRL)\u00a054(5), 530\u2013543 (2007)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"43_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"M.Y. Kovalyov","year":"2007","unstructured":"Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research\u00a0178(2), 331\u2013342 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"43_CR16","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1016\/j.cor.2011.03.001","volume":"38","author":"S.O. Krumke","year":"2011","unstructured":"Krumke, S.O., Thielen, C., Westphal, S.: Interval scheduling on related machines. Computers and Operations Research\u00a038(12), 1836\u20131844 (2011)","journal-title":"Computers and Operations Research"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science\u00a04, 445\u2013522 (1993)","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"43_CR18","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: SODA, pp. 302\u2013311 (1994)"},{"key":"43_CR19","unstructured":"Ludwig, W.T.: Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis (1995)"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-25873-2_2","volume-title":"Principles of Distributed Systems","author":"G.B. Mertzios","year":"2011","unstructured":"Mertzios, G.B., Shalom, M., Wong, P.W.H., Zaks, S.: Online Regenerator Placement. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 4\u201317. Springer, Heidelberg (2011)"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Shalom, M., Voloshin, A., Wong, P.W.H., Zaks, S.: Optimizing busy time on parallel machines. In: IPDPS (to appear, 2012)","DOI":"10.1109\/IPDPS.2012.31"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Oprescu, A., Kielmann, T.: Bag-of-tasks scheduling under budget constraints. In: CloudCom, pp. 351\u2013359 (2010)","DOI":"10.1109\/CloudCom.2010.32"},{"key":"43_CR23","unstructured":"Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. In: SODA, pp. 879\u2013888 (2000)"},{"key":"43_CR24","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 15-1\u201315-41. CRC Press (2004)"},{"key":"43_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/978-3-540-68111-3_112","volume-title":"Parallel Processing and Applied Mathematics","author":"U.M. Schwarz","year":"2008","unstructured":"Schwarz, U.M.: Tightness Results for Malleable Task Scheduling Algorithms. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol.\u00a04967, pp. 1059\u20131067. Springer, Heidelberg (2008)"},{"key":"43_CR26","unstructured":"Shalom, M., Voloshin, A., Wong, P.W., Yung, F.C., Zaks, S.: Online optimization of switching cost in optical networks with traffic grooming. Technical Report CS-2012-02, Department of Computer Science, Technion, Haifa, Israel (March 2012)"},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Shi, W., Hong, B.: Resource allocation with a budget constraint for computing independent tasks in the cloud. In: CloudCom, pp. 327\u2013334 (2010)","DOI":"10.1109\/CloudCom.2010.54"},{"key":"43_CR28","doi-asserted-by":"crossref","unstructured":"Vasi\u0107, N., Barisits, M., Salzgeber, V., Kostic, D.: Making cluster applications energy-aware. In: ACDC, pp. 37\u201342 (2009)","DOI":"10.1145\/1555271.1555281"},{"key":"43_CR29","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830\u2013831 (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T04:11:20Z","timestamp":1713931880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_43"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}