{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:15Z","timestamp":1759847775394},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T00:00:00Z","timestamp":1413849600000},"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":[[2015,6]]},"DOI":"10.1007\/s10951-014-0399-4","type":"journal-article","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T06:50:40Z","timestamp":1413787840000},"page":"275-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The impact of core precedences in a cyclic RCPSP with precedence delays"],"prefix":"10.1007","volume":"18","author":[{"given":"Zdenek","family":"Hanzalek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"issue":"3","key":"399_CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"VH Allan","year":"1995","unstructured":"Allan, V. H., Jones, R. B., Lee, R. M., & Allan, S. J. (1995). Software pipelining. ACM Computing Surveys, 27(3), 367\u2013432.","journal-title":"ACM Computing Surveys"},{"key":"399_CR2","unstructured":"Ayala, M., & Artigues, C. (2010). On integer linear programming formulations for the resource-constrained modulo scheduling problem. LAAS report 10393."},{"issue":"3","key":"399_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10589-012-9499-2","volume":"54","author":"M Ayala","year":"2013","unstructured":"Ayala, M., Benabid, A., Artigues, C., & Hanen, C. (2013). The resource-constrained modulo scheduling problem: An experimental study. Computational Optimization and Applications, 54(3), 645\u2013673. doi: 10.1007\/s10589-012-9499-2 .","journal-title":"Computational Optimization and Applications"},{"key":"399_CR4","first-page":"140.1","volume-title":"Workshop on Parallel and Distributed Real-Time Systems (WPDRTS)","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Brinksma, E., Hendriks, M., & Mader, A. (2005). Production scheduling by reachability analysis: A case study. Workshop on Parallel and Distributed Real-Time Systems (WPDRTS) (p. 140.1). Los Alamitos: IEEE Computer Society Press."},{"issue":"5","key":"399_CR5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10951-010-0220-y","volume":"14","author":"A Benabid","year":"2011","unstructured":"Benabid, A., & Hanen, C. (2011). Worst case analysis of decomposed software pipelining for cyclic unitary rcpsp with precedence delays. Journal of Scheduling, 14(5), 511\u2013522.","journal-title":"Journal of Scheduling"},{"key":"399_CR6","doi-asserted-by":"crossref","unstructured":"Bonfietti, A., Lombardi, M., Benini, L., & Milano, M. (2011). A constraint based approach to cyclic rcpsp. In CP\u201911, pp. 130\u2013144.","DOI":"10.1007\/978-3-642-23786-7_12"},{"issue":"1","key":"399_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/71.655240","volume":"9","author":"PY Calland","year":"1998","unstructured":"Calland, P. Y., Darte, A., & Robert, Y. (1998). Circuit retiming applied to decomposed software pipelining. IEEE Transactions on Parallel and Distributed Systems, 9(1), 24\u201335. doi: 10.1109\/71.655240 .","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"399_CR8","unstructured":"Dasdan, A., Irani, S., & Gupta, R. K. (1999). Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Design Automation Conference (pp. 37\u201342)."},{"key":"399_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/9780470611227.ch18","volume-title":"Resource-constrained project scheduling: models, algorithms, extensions and applications, control systems, robotics and manufacturing series","author":"B Dupont de Dinechin","year":"2008","unstructured":"Dupont de Dinechin, B., Artigues, C., & Azem, S. (2008). Resource constrained modulo scheduling. In C. Artigues, S. Demassey, & E. Neron (Eds.), Resource-constrained project scheduling: models, algorithms, extensions and applications, control systems, robotics and manufacturing series (pp. 267\u2013277). London: ISTE and Wiley."},{"issue":"2","key":"399_CR10","first-page":"1","volume":"1","author":"B Dupont de Dinechin","year":"2004","unstructured":"Dupont de Dinechin, B. (2004). From machine scheduling to vliw instruction scheduling. ST Journal of Research, 1(2), 1\u201335.","journal-title":"ST Journal of Research"},{"key":"399_CR11","unstructured":"Dupont de Dinechin, B. (2007). Time-indexed formulations and a large neighborhood search for the resource-constrained modulo scheduling problem. In P. Baptiste, G. Kendall, A. Munier-Kordon, & F. Sourd (Eds.), 3rd Multidisciplinary International Scheduling Conference: Theory and Applications."},{"key":"399_CR12","doi-asserted-by":"crossref","unstructured":"Eichenberger, A., & Davidson, E. (1997). Efficient formulation for optimal modulo schedulers. SIGPLAN-PLDI\u201997.","DOI":"10.1145\/258916.258933"},{"key":"399_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626494000363","volume":"4","author":"F Gasperoni","year":"1994","unstructured":"Gasperoni, F., & Schwiegelshohn, U. (1994). Generating close to optimum loop schedules on parallel processors. Parallel Processing Letters, 4, 391\u2013403.","journal-title":"Parallel Processing Letters"},{"key":"399_CR14","volume-title":"Scheduling theory and its applications","author":"C Hanen","year":"1994","unstructured":"Hanen, C., & Munier, A. (1994). Cyclic scheduling on parallel processors: An overview. In P. Chr\u00e9tienne, E. G. Coffman, J. K. Lenstra, & Z. Liu (Eds.), Scheduling theory and its applications. Chichester: Wiley."},{"issue":"3","key":"399_CR15","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TII.2010.2052819","volume":"6","author":"Z Hanzalek","year":"2010","unstructured":"Hanzalek, Z., Burget, P., & Sucha, P. (2010). Profinet io irt message scheduling with temporal constraints. IEEE Transactions on Industrial Informatics, 6(3), 369\u2013380. doi: 10.1109\/TII.2010.2052819 .","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"3","key":"399_CR16","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TII.2010.2050144","volume":"6","author":"Z Hanzalek","year":"2010","unstructured":"Hanzalek, Z., & Jurcik, P. (2010). Energy efficient scheduling for cluster-tree wireless sensor networks with time-bounded data flows: Application to ieee 802.15.4\/zigbee. IEEE Transactions on Industrial Informatics, 6(3), 438\u2013450. doi: 10.1109\/TII.2010.2050144 .","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"399_CR17","doi-asserted-by":"crossref","unstructured":"Hanzalek, Z., & Pacha, T. (1998). Use of the fieldbus systems in academic setting. In Proceedings of Real-Time Systems Education III (pp. 93\u201397). doi: 10.1109\/RTSE.1998.766518","DOI":"10.1109\/RTSE.1998.766518"},{"issue":"8","key":"399_CR18","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1080\/00207540310001638055","volume":"42","author":"W Herroelen","year":"2004","unstructured":"Herroelen, W., & Leus, R. (2004). Robust and reactive project scheduling: A review and classification of procedures. International Journal of Production Research, 42(8), 1599\u20131620.","journal-title":"International Journal of Production Research"},{"key":"399_CR19","doi-asserted-by":"crossref","unstructured":"Huff, R. A. (1993). Lifetime-sensitive modulo scheduling. In Proceedings of the ACM SIGPLAN \u201993 Conference on Programming Language Design and Implementation (pp. 258\u2013267).","DOI":"10.1145\/155090.155115"},{"issue":"1","key":"399_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10951-013-0331-3","volume":"17","author":"ES Kim","year":"2014","unstructured":"Kim, E. S., & Glass, C. (2014). Perfect periodic scheduling for three basic cycles. Journal of Scheduling, 17(1), 47\u201365. doi: 10.1007\/s10951-013-0331-3 .","journal-title":"Journal of Scheduling"},{"issue":"7","key":"399_CR21","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/960116.54022","volume":"23","author":"M Lam","year":"1988","unstructured":"Lam, M. (1988). Software pipelining: An effective scheduling technique for vliw machines. SIGPLAN Notices, 23(7), 318\u2013328. doi: 10.1145\/960116.54022 .","journal-title":"SIGPLAN Notices"},{"key":"399_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5772\/52","volume-title":"Multiprocessor scheduling: Theory and applications","author":"E Levner","year":"2007","unstructured":"Levner, E., Kats, V., & de Pablo, D. A. L. (2007). Cyclic scheduling in robotic cells: An extension of basic models in machine scheduling theory. In E. Levner (Ed.), Multiprocessor scheduling: Theory and applications (pp. 1\u201320). Vienna: I-Tech Education and Publishing."},{"key":"399_CR23","doi-asserted-by":"crossref","unstructured":"Llosa, J. (1996). Swing modulo scheduling: A lifetime-sensitive approach. In Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT \u201996 (pp. 80). Washington, DC: IEEE Computer Society. http:\/\/dl.acm.org\/citation.cfm?id=882471.883302 .","DOI":"10.1109\/PACT.1996.554030"},{"key":"399_CR24","doi-asserted-by":"crossref","unstructured":"Munier-Kordon, A. (2010). A graph-based analysis of the cyclic scheduling problem with time constraints: Schedulability and periodicity of the earliest schedule. Journal of Scheduling, 1\u201315. doi: 10.1007\/s10951-009-0159-z .","DOI":"10.1007\/s10951-009-0159-z"},{"key":"399_CR25","unstructured":"Proth, J. M., & Xie, X. (1995). Mod\u00e9lisation, analyse et optimisation des syst\u00e8mes \u00e0 fonctionnement cyclique. Masson (1995)."},{"key":"399_CR26","doi-asserted-by":"crossref","unstructured":"Rau, B. R. (1994). Iterative modulo scheduling: An algorithm for software pipelining loops. In Proceedings of the 27th Annual International Symposium on Microarchitecture (MICRO 27) (pp. 63\u201374). New York, NY: ACM.","DOI":"10.1145\/192724.192731"},{"key":"399_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9781420072747","volume-title":"Introduction to scheduling","author":"Y Robert","year":"2009","unstructured":"Robert, Y., & Vivien, F. (2009). Introduction to scheduling. Boca Raton, FL: CRC Press."},{"key":"399_CR28","doi-asserted-by":"crossref","unstructured":"Smelyanskiy, M., Mahlke, S., & Davidson, E. (2004). Probabilistic predicate -aware modulo scheduling. In International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization.","DOI":"10.1109\/CGO.2004.1281671"},{"issue":"3","key":"399_CR29","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02577737","volume":"22","author":"J Wang","year":"1994","unstructured":"Wang, J., Eisenbeis, C., Jourdan, M., & Su, B. (1994). Decomposed software pipelining: A new perspective and a new approach. International Journal of Parallel Programming, 22(3), 351\u2013373. doi: 10.1007\/BF02577737 .","journal-title":"International Journal of Parallel Programming"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0399-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0399-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0399-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0399-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,21]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["399"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0399-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,21]]}}}