{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:11:23Z","timestamp":1783397483971,"version":"3.54.6"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T00:00:00Z","timestamp":1492560000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IH13004"],"award-info":[{"award-number":["01IH13004"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 901"],"award-info":[{"award-number":["SFB 901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institut teoretick\u00e9 informatiky","award":["P202\/12\/G061"],"award-info":[{"award-number":["P202\/12\/G061"]}]},{"DOI":"10.13039\/100009059","name":"Pacific Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10951-017-0518-0","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T19:18:27Z","timestamp":1492629507000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling shared continuous resources on many-cores"],"prefix":"10.1007","volume":"21","author":[{"given":"Ernst","family":"Althaus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Brinkmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedhelm Meyer","family":"auf\u00a0der Heide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"S\u00fc\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,19]]},"reference":[{"key":"518_CR1","volume-title":"Handbook on scheduling: From theory to applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz, J., Ecker, K. H., & Pesch, E. (2007). Handbook on scheduling: From theory to applications. Berlin: Springer."},{"key":"518_CR2","volume-title":"Handbook on scheduling\u2014From theory to applications. International handbooks on information systems","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook on scheduling\u2014From theory to applications. International handbooks on information systems. Berlin: Springer."},{"issue":"6","key":"518_CR3","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s00224-006-1249-3","volume":"39","author":"F Chung","year":"2006","unstructured":"Chung, F., Graham, R., Mao, J., & Varghese, G. (2006). Parallelism versus memory allocation in pipelined router forwarding engines. Theory of Computing Systems, 39(6), 829\u2013849.","journal-title":"Theory of Computing Systems"},{"issue":"1\u20132","key":"518_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00453-010-9445-6","volume":"62","author":"L Epstein","year":"2012","unstructured":"Epstein, L., Levin, A., & van Stee, R. (2012). Approximation schemes for packing splittable items with cardinality constraints. Algorithmica, 62(1\u20132), 102\u2013129. doi: 10.1007\/s00453-010-9445-6 .","journal-title":"Algorithmica"},{"issue":"1","key":"518_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00224-009-9226-2","volume":"48","author":"L Epstein","year":"2011","unstructured":"Epstein, L., & van Stee, R. (2011). Improved results for a memory allocation problem. Theory of Computing Systems, 48(1), 79\u201392. doi: 10.1007\/s00224-009-9226-2 .","journal-title":"Theory of Computing Systems"},{"issue":"12","key":"518_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.7494\/dmms.2007.1.2.59","volume":"1","author":"A Janiak","year":"2007","unstructured":"Janiak, A., Janiak, W., & Lichtenstein, M. (2007). Resource management in machine scheduling problems: A survey. Decision Making in Manufacturing and Services, 1(12), 59\u201389.","journal-title":"Decision Making in Manufacturing and Services"},{"issue":"1","key":"518_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(99)00025-6","volume":"94","author":"J J\u00f3zefowska","year":"1999","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., & Weglarz, J. (1999). Discrete\u2013continuous scheduling to minimize the makespan for power processing rates of jobs. Discrete Applied Mathematics, 94(1), 263\u2013285.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"518_CR8","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s001860000094","volume":"52","author":"J J\u00f3zefowska","year":"2000","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., & Weglarz, J. (2000). Solving the discrete\u2013continuous project scheduling problem via its discretization. Mathematical Methods of Operations Research, 52(3), 489\u2013499.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"6","key":"518_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jos.119","volume":"5","author":"J J\u00f3zefowska","year":"2002","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., & Weglarz, J. (2002). A heuristic approach to allocating the continuous resource in discrete\u2013continuous scheduling problems to minimize the makespan. Journal of Scheduling, 5(6), 487\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"518_CR10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0377-2217(96)00130-0","volume":"94","author":"J J\u00f3zefowska","year":"1996","unstructured":"J\u00f3zefowska, J., & Weglarz, J. (1996). Discrete\u2013continuous scheduling problems\u2014Mean completion time results. European Journal of Operational Research, 94(2), 302\u2013309.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"518_CR11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0377-2217(97)00346-9","volume":"107","author":"J J\u00f3zefowska","year":"1998","unstructured":"J\u00f3zefowska, J., & Weglarz, J. (1998). On a methodology for discrete\u2013continuous scheduling. European Journal of Operational Research, 107(2), 338\u2013353.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"518_CR12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10107-004-0551-6","volume":"103","author":"T Kis","year":"2005","unstructured":"Kis, T. (2005). A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming, 103(3), 515\u2013539.","journal-title":"Mathematical Programming"},{"key":"518_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"JYT Leung","year":"2004","unstructured":"Leung, J. Y. T. (2004). Handbook of scheduling: Algorithms, models, and performance analysis. London: Chapman & Hall."},{"key":"518_CR14","doi-asserted-by":"publisher","unstructured":"R\u00f3\u017cycki, R., Weglarz, J. (2011). Power-aware acheduling of preemptable jobs on identical parallel processors to minimize makespan. Annals of Operations Research. doi: 10.1007\/s10479-011-0957-5","DOI":"10.1007\/s10479-011-0957-5"},{"issue":"1","key":"518_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ejor.2011.10.017","volume":"218","author":"R R\u00f3\u017cycki","year":"2012","unstructured":"R\u00f3\u017cycki, R., & Weglarz, J. (2012). Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines. European Journal of Operational Research, 218(1), 68\u201375. doi: 10.1016\/j.ejor.2011.10.017 .","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"518_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10589-010-9343-5","volume":"48","author":"G Walig\u00f3ra","year":"2011","unstructured":"Walig\u00f3ra, G. (2011). Heuristic approaches to discrete\u2013continuous project scheduling problems to minimize the makespan. Computational Optimization and Applications, 48(2), 399\u2013421.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"518_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J Weglarz","year":"2011","unstructured":"Weglarz, J., J\u00f3zefowska, J., Mika, M., & Walig\u00f3ra, G. (2011). Project scheduling with finite or infinite number of activity processing modes\u2014A survey. European Journal of Operational Research, 208(3), 177\u2013205.","journal-title":"European Journal of Operational Research"},{"key":"518_CR18","doi-asserted-by":"crossref","unstructured":"Yao, F.F., Demers, A.J., Shenker, S. (1995). A scheduling model for reduced CPU energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 374\u2013382.","DOI":"10.1109\/SFCS.1995.492493"},{"issue":"1","key":"518_CR19","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2379776.2379780","volume":"45","author":"S Zhuravlev","year":"2012","unstructured":"Zhuravlev, S., Saez, J. C., Blagodurov, S., Fedorova, A., & Prieto, M. (2012). Survey of scheduling techniques for addressing shared resources in multicore processors. ACM Computing Surveys (CSUR), 45(1), 4:1\u20134:28. doi: 10.1145\/2379776.2379780 .","journal-title":"ACM Computing Surveys (CSUR)"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0518-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0518-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0518-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T17:43:54Z","timestamp":1658943834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0518-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,19]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0518-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,19]]}}}