{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:05Z","timestamp":1746115865017,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_11","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"101-113","source":"Crossref","is-referenced-by-count":0,"title":["DVS Scheduling in a Line or a Star Network of Processors"],"prefix":"10.1007","author":[{"given":"Zongxu","family":"Mu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Albers, S.: Algorithms for Dynamic Speed Scaling. In: STACS 2011, pp. 1\u201311 (2011)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Fernandez, A., Zhang, L., Zhao, W.: Routing for Energy Minimization in the Speed Scaling Model. In: Proceedings of 29th IEEE International Conference on Computer Communications, pp. 2435\u20132443 (2010)","DOI":"10.1109\/INFCOM.2010.5462071"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-70575-8_34","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2008","unstructured":"Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for speed bounded processors. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 409\u2013420. Springer, Heidelberg (2008)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic Speed Scaling to Manage Energy and Temperature. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 520\u2013529 (2004)","DOI":"10.1109\/FOCS.2004.24"},{"key":"11_CR5","unstructured":"Chan, H.L., Chan, W.T., Lam, T.W., Lee, L.K., Mak, K.S., Wong, P.W.H.: Energy Efficient Online Deadline Scheduling. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 795\u2013804 (2007)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-72504-6_38","volume-title":"Theory and Applications of Models of Computation","author":"J.W.-T. Chan","year":"2007","unstructured":"Chan, J.W.-T., Lam, T.-W., Mak, K.-S., Wong, P.W.H.: Online deadline scheduling with bounded energy efficiency. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 416\u2013427. Springer, Heidelberg (2007)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. of Oper. Res.\u00a01, 117\u2013129 (1976)","journal-title":"Math. of Oper. Res."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann. Discrete Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"11_CR9","unstructured":"Hong, I., Qu, G., Potkonjak, M., Srivastavas, M.B.: Synthesis techniques for low-power hard real-time systems on variable voltage processors. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 178\u2013187 (1998)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S. Irani","year":"2005","unstructured":"Irani, S., Pruhs, K.: Algorithmic Problems in Power Management. ACM SIGACT News\u00a036(2), 63\u201376 (2005)","journal-title":"ACM SIGACT News"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ishihara, T., Yasuura, H.: Voltage Scheduling Problem for Dynamically Variable Voltage Processors. In: Proceedings of International Symposium on Low Power Electronics and Design, pp. 197\u2013202 (1998)","DOI":"10.1145\/280756.280894"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal Two- and Three-stage Production Schedules with Setup Times Included. Naval Res. Logist. Quart.\u00a01, 61\u201368 (1954)","journal-title":"Naval Res. Logist. Quart."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kwon, W., Kim, T.: Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors. In: Proceedings of the 40th Conference on Design Automation, pp. 125\u2013130 (2003)","DOI":"10.1145\/775832.775867"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Lee, L.K., To, I.K.K., Wong, P.W.H.: Energy Efficient Deadline Scheduling in Two Processor Systems. In: Proceedings of the 18th International Symposium on Algorithm and Computation, pp. 476\u2013487 (2007)","DOI":"10.1007\/978-3-540-77120-3_42"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/050629434","volume":"35","author":"M. Li","year":"2005","unstructured":"Li, M., Yao, F.F.: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM Journal on Computing\u00a035(3), 658\u2013671 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"3983","DOI":"10.1073\/pnas.0510886103","volume":"103","author":"M. Li","year":"2005","unstructured":"Li, M., Yao, A.C., Yao, F.F.: Discrete and Continuous Min-Energy Schedules for Variable Voltage Processors. Proceedings of the National Academy of Sciences USA\u00a0103, 3983\u20133987 (2005)","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"11_CR17","first-page":"129","volume-title":"Flow Shops and Flexible Fow Shops (Deterministic)","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. In: Flow Shops and Flexible Fow Shops (Deterministic), 2nd edn., ch. 6, p. 129. Prentice-Hall, Englewood Cliffs (2002)","edition":"2"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/978-3-642-15369-3_27","volume-title":"APPROX and RANDOM 2010","author":"K. Pruhs","year":"2010","unstructured":"Pruhs, K., Stein, C.: How to Schedule When You Have to Buy Your Energy. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 352\u2013365. Springer, Heidelberg (2010)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-10631-6_48","volume-title":"Algorithms and Computation","author":"W. Wu","year":"2009","unstructured":"Wu, W., Li, M., Chen, E.: Min-Energy Scheduling for Aligned Jobs in Accelerate Model. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 462\u2013472. Springer, Heidelberg (2009)"},{"key":"11_CR20","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:26:28Z","timestamp":1746008788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}