{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:17:52Z","timestamp":1689931072114},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T00:00:00Z","timestamp":1267056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0718-x","type":"journal-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T23:36:20Z","timestamp":1266968180000},"page":"51-77","source":"Crossref","is-referenced-by-count":17,"title":["Optimal resource allocation and scheduling for\u00a0the\u00a0CELL BE platform"],"prefix":"10.1007","volume":"184","author":[{"given":"Luca","family":"Benini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Lombardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martino","family":"Ruggiero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"issue":"3","key":"718_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(3), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"718_CR2","doi-asserted-by":"crossref","unstructured":"Benini, L., Bertozzi, D., Guerri, A., & Milano, M. (2005). Allocation and scheduling for MPSOCs via decomposition and no-good generation. In Proc. of the int.l conference in principles and practice of constraint programming (CP 2005).","DOI":"10.1007\/11564751_11"},{"key":"718_CR3","doi-asserted-by":"crossref","unstructured":"Benini, L., Bertozzi, D., Guerri, A., & Milano, M. (2006). Allocation, scheduling and voltage scaling on energy aware MPSoCs. In Proc. of the int.l conference on integration of artificial intelligence and operations research techniques in constraint programming (CPAIOR 2006).","DOI":"10.1007\/11757375_6"},{"key":"718_CR4","unstructured":"Benini, L., Lombardi, M., Mantovani, M., Milano, M., & Ruggiero, M. (2008a). Multi-stage Benders decomposition for optimizing multicore architectures. In Proceedings of the int.l conference on the integration of AI and OR techniques in CP for combinatorial optimization problems."},{"key":"718_CR5","doi-asserted-by":"crossref","unstructured":"Benini, L., Lombardi, M., Milano, M., & Ruggiero, M. (2008b). A constraint programming approach for allocation and scheduling on the CELL broadband engine. In Proc. of the int.l conference in principles and practice of constraint programming (pp. 21\u201335).","DOI":"10.1007\/978-3-540-85958-1_2"},{"key":"718_CR6","unstructured":"Bockmayr, A., & Pisaruk, N. (2003). Detecting infeasibility and generating cuts for MIP using CP. In Int. workshop integration AI OR techniques constraint programming combin. optim. problems CP-AI-OR03, Montreal, Canada."},{"key":"718_CR7","first-page":"752","volume-title":"Proc. of the int.l conference in principles and practice of constraint programming","author":"H. Cambazard","year":"2005","unstructured":"Cambazard, H., & Jussien, N. (2005). Integrating benders decomposition within constraint programming. In Proc. of the int.l conference in principles and practice of constraint programming (pp. 752\u2013756). Berlin: Springer."},{"key":"718_CR8","unstructured":"Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In Joint international conference on symposium on logic programming (pp. 363\u2013377)."},{"key":"718_CR9","unstructured":"Chen, T., Raghavan, R., Dale, J., & Iwata, E. (2005). Cell broadband engine architecture and its first implementation. In IBM White paper."},{"key":"718_CR10","unstructured":"de Siqueira, N. J. L., & Puget, J. F. (1988). Explanation-based generalisation of failures. In European conference on artificial intelligence (pp. 339\u2013344)."},{"key":"718_CR11","doi-asserted-by":"crossref","unstructured":"Flachs, B. et al. (2005). A streaming processing unit for a cell processor. In Solid-state circuits conference. Digest of technical papers. ISSCC. 2005 IEEE International (pp.\u00a0134\u2013135).","DOI":"10.1109\/ISSCC.2005.1493905"},{"key":"718_CR12","unstructured":"Gent, I. P., & Smith, B. M. (2000). Symmetry breaking in constraint programming. In Proceedings of the European conference on artificial intelligence ECAI (pp.\u00a0599\u2013603)."},{"key":"718_CR13","first-page":"431","volume-title":"Proceedings of the fifteenth national conference on artificial intelligence and tenth innovative applications of artificial intelligence conference","author":"C. P. Gomes","year":"1998","unstructured":"Gomes, C. P., Selman, B., & Kautz, H. A. (1998). Boosting combinatorial search through randomization. In Proceedings of the fifteenth national conference on artificial intelligence and tenth innovative applications of artificial intelligence conference (pp. 431\u2013437). Menlo Park, Cambridge: AAAI Press\/The MIT Press."},{"key":"718_CR14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"I. E. Grossmann","year":"2001","unstructured":"Grossmann, I. E., & Jain, V. (2001). Algorithms for hybrid milp\/cp models for a class of optimization problems. INFORMS Journal on Computing, 13, 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"key":"718_CR15","unstructured":"Guerri, A., Lombardi, M., & Milano, M. (2007). Challenging scheduling problem in the field of system design. In Proceedings of ICAPS 2007, first workshop on scheduling a scheduling competition."},{"key":"718_CR16","unstructured":"Hofstee, H. (2005). Cell broadband engine architecture from 20,000 feet. In IBM White paper."},{"key":"718_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Proc. of the 10th intern. conference on principles and practice of constraint programming\u2014CP 2004","author":"J. N. Hooker","year":"2004","unstructured":"Hooker, J. N. (2004). A hybrid method for planning and scheduling. In Proc. of the 10th intern. conference on principles and practice of constraint programming\u2014CP 2004, Toronto, Canada, Sept. 2004 (pp.\u00a0305\u2013316). Berlin: Springer."},{"key":"718_CR18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Proc. of the 11th intern. conference on principles and practice of constraint programming\u2014CP 2005","author":"J. N. Hooker","year":"2005","unstructured":"Hooker, J. N. (2005). Planning and scheduling to minimize tardiness. In Proc. of the 11th intern. conference on principles and practice of constraint programming\u2014CP 2005, Sites, Spain, Sept. 2004 (pp. 314\u2013327). Berlin: Springer."},{"key":"718_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J. N. Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based benders decomposition. Mathematical Programming, 96, 33\u201360.","journal-title":"Mathematical Programming"},{"key":"718_CR20","first-page":"167","volume-title":"Proc. of the nineteenth national conference on artificial intelligence\u2014AAAI 2004","author":"U. Junker","year":"2004","unstructured":"Junker, U. (2004). QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In Proc. of the nineteenth national conference on artificial intelligence\u2014AAAI 2004, San Jose, California, USA, Jul. 2004 (pp. 167\u2013172). Menlo Park, Cambridge: AAAI Press\/The MIT Press."},{"issue":"8","key":"718_CR21","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/MC.2003.1220582","volume":"36","author":"J. U. Kapasi","year":"2003","unstructured":"Kapasi, J. U., Rixner, S., Dally, W. J., Khailany, B., Ho Ahn, J., Mattson, P., & Owens, J. D. (2003). Programmable stream processors. Computer, 36(8), 54\u201362.","journal-title":"Computer"},{"issue":"3","key":"718_CR22","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MM.2006.49","volume":"26","author":"M. Kistler","year":"2006","unstructured":"Kistler, M., Perrone, M., & Petrini, F. (2006). Cell multiprocessor communication network: built for speed. IEEE Micro, 26(3), 10\u201323.","journal-title":"IEEE Micro"},{"key":"718_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Journal of Artificial Intelligence, 143, 151\u2013188.","journal-title":"Journal of Artificial Intelligence"},{"key":"718_CR24","unstructured":"Laborie, P. (2005). Complete MCS-based search: application to resource constrained project scheduling. In International joint conferences on artificial intelligence (pp. 181\u2013186)."},{"issue":"2","key":"718_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"Le Pape, C. (1994). Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3(2), 55\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"718_CR26","doi-asserted-by":"crossref","unstructured":"Pham, D., et al. (2005). The design and implementation of a first-generation cell processor. In IEEE international solid-state circuits conference ISSCC (Vol.\u00a01, pp. 184\u2013592).","DOI":"10.1109\/ISSCC.2005.1493930"},{"issue":"3","key":"718_CR27","first-page":"163","volume":"20","author":"N. Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., & Smith, S. F. (2007). From precedence constraint posting to partial order schedules: a CSP approach to robust scheduling. Artificial Intelligence Communication (AICOM), 20(3), 163\u2013180.","journal-title":"Artificial Intelligence Communication (AICOM)"},{"issue":"2","key":"718_CR28","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.1040.0110","volume":"18","author":"R. Sadykov","year":"2006","unstructured":"Sadykov, R., & Wolsey, L. A. (2006). Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS Journal on Computing, 18(2), 209\u2013217.","journal-title":"INFORMS Journal on Computing"},{"key":"718_CR29","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s002360050095","volume":"34","author":"R. Stephens","year":"1997","unstructured":"Stephens, R. (1997). A survey of stream processing. Acta Informatica, 34, 491\u2013541.","journal-title":"Acta Informatica"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0718-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0718-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0718-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:00Z","timestamp":1559153280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0718-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,25]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["718"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0718-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,25]]}}}