{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:51Z","timestamp":1759637991784},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T00:00:00Z","timestamp":1381795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9668-y","type":"journal-article","created":{"date-parts":[[2013,10,13]],"date-time":"2013-10-13T23:40:36Z","timestamp":1381707636000},"page":"16-35","source":"Crossref","is-referenced-by-count":4,"title":["DVS scheduling in a line or a star network of processors"],"prefix":"10.1007","volume":"29","author":[{"given":"Zongxu","family":"Mu","sequence":"first","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"9668_CR1","unstructured":"Albers S (2011) Algorithms for dynamic speed scaling. In: STACS 2011, pp 1\u201311"},{"key":"9668_CR2","doi-asserted-by":"crossref","unstructured":"Andrews M, Fernandez A, Zhang L, Zhao W (2010) Routing for energy minimization in the speed scaling model. In: Proceedings of 29th IEEE international conference on computer communications, pp 2435\u20132443","DOI":"10.1109\/INFCOM.2010.5462071"},{"key":"9668_CR3","doi-asserted-by":"crossref","unstructured":"Bansal N, Chan HL, Lam TW, Lee L-K (2008) Scheduling for speed bounded processors. In: Proceedings of the 35th international symposium on automata, languages and programming, pp 409\u2013420","DOI":"10.1007\/978-3-540-70575-8_34"},{"key":"9668_CR4","doi-asserted-by":"crossref","unstructured":"Bansal N, Kimbrel T, Pruhs K (2004) Dynamic speed scaling to manage energy and temperature. In: Proceedings of the 45th annual symposium on foundations of computer science, pp 520\u2013529","DOI":"10.1109\/FOCS.2004.24"},{"key":"9668_CR5","unstructured":"Chan HL, Chan WT, Lam TW, Lee LK, Mak KS, Wong PWH (2007) Energy efficient online deadline scheduling. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 795\u2013804"},{"key":"9668_CR6","doi-asserted-by":"crossref","unstructured":"Chan WT, Lam TW, Mak KS, Wong PWH (2007) Online deadline scheduling with bounded energy efficiency. In: Proceedings of the 4th annual conference on theory and applications of models of computation, pp 416\u2013427","DOI":"10.1007\/978-3-540-72504-6_38"},{"key":"9668_CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey M, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"9668_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"9668_CR9","doi-asserted-by":"crossref","unstructured":"Hong I, Qu G, Potkonjak M, Srivastavas MB (1998) 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","DOI":"10.1109\/REAL.1998.739744"},{"issue":"2","key":"9668_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani S, Pruhs K (2005) Algorithmic problems in power management. ACM SIGACT News 36(2):63\u201376","journal-title":"ACM SIGACT News"},{"key":"9668_CR11","doi-asserted-by":"crossref","unstructured":"Ishihara T, Yasuura H (1998) Voltage scheduling problem for dynamically variable voltage processors. In: Proceedings of international symposium on low power electronics and design, pp 197\u2013202","DOI":"10.1145\/280756.280894"},{"key":"9668_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1:61\u201368","journal-title":"Naval Res Logist Q"},{"key":"9668_CR13","doi-asserted-by":"crossref","unstructured":"Kwon W, Kim T (2003) Optimal voltage allocation techniques for dynamically variable voltage processors. In: Proceedings of the 40th conference on design automation, pp 125\u2013130","DOI":"10.1145\/775832.775867"},{"key":"9668_CR14","doi-asserted-by":"crossref","unstructured":"Lam TW, Lee LK, To IKK, Wong PWH (2007) Energy efficient deadline scheduling in two processor systems. In: Proceedings of the 18th international symposium on algorithm and computation, pp 476\u2013487","DOI":"10.1007\/978-3-540-77120-3_42"},{"issue":"3","key":"9668_CR15","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/050629434","volume":"35","author":"M Li","year":"2005","unstructured":"Li M, Yao FF (2005) An efficient algorithm for computing optimal discrete voltage schedules. SIAM J Comput 35(3):658\u2013671","journal-title":"SIAM J Comput"},{"key":"9668_CR16","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1073\/pnas.0510886103","volume":"103","author":"M Li","year":"2005","unstructured":"Li M, Yao AC, Yao FF (2005) Discrete and continuous min-energy schedules for variable voltage processors. Proc Natl Acad Sci USA 103:3983\u20133987","journal-title":"Proc Natl Acad Sci USA"},{"key":"9668_CR17","volume-title":"Flow shops and flexible fow shops (deterministic), scheduling: theory, algorithms, and systems (chapter 6)","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Flow shops and flexible fow shops (deterministic), scheduling: theory, algorithms, and systems (chapter 6), 2nd edn. Prentice Hall, Englewood Cliffs","edition":"2"},{"key":"9668_CR18","doi-asserted-by":"crossref","unstructured":"Pruhs K, Stein C (2010) How to schedule when you have to buy your energy. In: Proceedings of the 13th international workshop on approximation, randomization, and combinatorial optimization. Algorithms and techniques, pp 352\u2013365","DOI":"10.1007\/978-3-642-15369-3_27"},{"key":"9668_CR19","doi-asserted-by":"crossref","unstructured":"Wu W, Li M, Chen E (2009) Min-energy scheduling for aligned jobs in accelerate model. In: Proceedings of the 20th international symposium on algorithms and computation, pp 462\u2013472","DOI":"10.1007\/978-3-642-10631-6_48"},{"key":"9668_CR20","doi-asserted-by":"crossref","unstructured":"Yao F, Demers A, Shenker S (1995) A scheduling model for reduced CPU energy. In: Proceedings of the 36th annual IEEE symposium on foundations of computer science, pp 374\u2013382","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9668-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9668-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9668-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:58:38Z","timestamp":1564502318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9668-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9668"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9668-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,15]]}}}