{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T11:29:55Z","timestamp":1660303795112},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"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":["J Sched"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10951-015-0437-x","type":"journal-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T05:48:45Z","timestamp":1437371325000},"page":"641-658","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing memory allocation for multistage scheduling including setup times"],"prefix":"10.1007","volume":"19","author":[{"given":"Anne","family":"Benoit","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Coqblin","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Nicod","sequence":"additional","affiliation":[]},{"given":"Veronika","family":"Rehn-Sonigo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"issue":"3","key":"437_CR1","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., & Soroush, H. (2008). The significance of reducing setup times\/setup costs. European Journal of Operational Research, 187(3), 978\u2013984.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"437_CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., & Kovalyov, M. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"437_CR3","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.jpdc.2007.11.004","volume":"68","author":"A Benoit","year":"2008","unstructured":"Benoit, A., & Robert, Y. (2008). Mapping pipeline skeletons onto heterogeneous platforms. Journal of Parallel and Distributed Computing, 68(6), 790\u2013808.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"437_CR4","unstructured":"Benoit, A., Coqblin, M., Nicod, J.M., Philippe, L., Rehn-Sonigo, V. (2012). Throughput optimization for pipeline workflow scheduling with setup times, Proceedings of CGWS 2012, the CoreGRID\/ERCIM Workshop on Grids, Clouds and P2P Computing, in conjunction with EuroPar 2012. http:\/\/graal.ens-lyon.fr\/~abenoit\/papers\/RR-7886.pdf"},{"issue":"1","key":"437_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0360-8352(99)00007-8","volume":"36","author":"A Bryan","year":"1999","unstructured":"Bryan, A., & Norman, (1999). Scheduling flowshops with finite buffers and sequence-dependent setup times. Computers & Industrial Engineering, 36(1), 163\u2013177.","journal-title":"Computers & Industrial Engineering"},{"key":"437_CR6","unstructured":"Burge, J., Munagala, K. & Srivastava, U. (2005). Ordering pipelined query operators with precedence constraints. Technical Report 2005\u201340, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/705\/ ."},{"key":"437_CR7","doi-asserted-by":"crossref","unstructured":"Guirado, F., Ripoll, A., Roig, C., Hern\u00e0ndez, A., Luque, E. (2006). Exploiting throughput for pipeline execution in streaming image processing applications, Proceedings of the 12th international conference on Parallel Processing, Euro-Par\u201906 (pp. 1095\u20131105). Berlin, Heidelberg: Springer.","DOI":"10.1007\/11823285_115"},{"key":"437_CR8","doi-asserted-by":"crossref","unstructured":"Hartley, T.D.R., Fasih, A., Berdanier, C.A., \u00d6zg\u00fcner, F. & \u00c7ataly\u00fcrek, \u00dcV. (2009). Investigating the use of gpu-accelerated nodes for sar image formation. CLUSTER, pp. 1\u20138.","DOI":"10.1109\/CLUSTR.2009.5289125"},{"key":"437_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1018948621875","volume":"76","author":"PB Luh","year":"1998","unstructured":"Luh, P. B., Gou, L., Zhang, Y., Nagahora, T., Tsuji, M., Yoneda, K., et al. (1998). Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals of Operations Research, 76, 233\u2013259.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"437_CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MSP.2005.1407713","volume":"22","author":"R Ramanath","year":"2005","unstructured":"Ramanath, R., Snyder, W., Yoo, Y., & Drew, M. (2005). Color image processing pipeline. Signal Processing Magazine, IEEE, 22(1), 34\u201343.","journal-title":"Signal Processing Magazine, IEEE"},{"key":"437_CR11","doi-asserted-by":"publisher","unstructured":"Schneider, S., Andrade, H., Gedik, B., Biem, A., & Wu, K.L. (2009). Elastic scaling of data parallel operators in stream processing. Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing, IEEE Computer Society (pp. 1\u201312). Washington, DC: IPDPS \u201909. DOI: 10.1109\/IPDPS.2009.5161036 .","DOI":"10.1109\/IPDPS.2009.5161036"},{"issue":"8","key":"437_CR12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/209937.209951","volume":"30","author":"J Subhlok","year":"1995","unstructured":"Subhlok, J., & Vondran, G. (1995). Optimal mapping of sequences of data parallel tasks. ACM SIGPLAN Notices, 30(8), 134\u2013143.","journal-title":"ACM SIGPLAN Notices"},{"key":"437_CR13","doi-asserted-by":"crossref","unstructured":"Subhlok, J., Vondran, G. (1996) Optimal latency-throughput tradeoffs for data parallel pipelines. Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures (p. 71). ACM.","DOI":"10.1145\/237502.237508"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0437-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0437-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:51Z","timestamp":1559453991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0437-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["437"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0437-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,21]]}}}