{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:25:59Z","timestamp":1759847159385},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T00:00:00Z","timestamp":1294444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10951-010-0220-y","type":"journal-article","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T11:43:25Z","timestamp":1294400605000},"page":"511-522","source":"Crossref","is-referenced-by-count":4,"title":["Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays"],"prefix":"10.1007","volume":"14","author":[{"given":"Abir","family":"Benabid","sequence":"first","affiliation":[]},{"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"220_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.ejor.2005.11.019","volume":"177","author":"D. Alcaide","year":"2007","unstructured":"Alcaide, D., Chu, C., Kats, V., Levner, E., & Sierksma, G. (2007). Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. European Journal of Operational Research, 177, 147\u2013162.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"220_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V. H. Allan","year":"1995","unstructured":"Allan, V. H., Jones, R. B., Lee, R. M., & Allan, S. J. (1995). Software pipelining. ACM Computer Survey, 27(3), 367\u2013432.","journal-title":"ACM Computer Survey"},{"issue":"1","key":"220_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation classification, models, and methods. European Journal of Operational Research, 112(1), 3\u201341.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"220_CR4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/71.655240","volume":"9","author":"P. Y. Calland","year":"1998","unstructured":"Calland, P. Y., Darte, A., & Robert, Y. (1998). Circuit retiming applied to decomposed software pipelining. IEEE Transactions of Parallel Distribution Systems, 9(1), 24\u201335.","journal-title":"IEEE Transactions of Parallel Distribution Systems"},{"issue":"4","key":"220_CR5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1142\/S0129053392000146","volume":"4","author":"H. C. Chou","year":"1992","unstructured":"Chou, H. C., & Chung, C. P. (1992). Upper bound analysis of scheduling arbitrary delay instruction on typed pipelined processors. International Journal of High Speed Computing, 4(4), 301\u2013312.","journal-title":"International Journal of High Speed Computing"},{"issue":"5","key":"220_CR6","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1023\/A:1007506711786","volume":"28","author":"A. Darte","year":"2000","unstructured":"Darte, A., & Huard, G. (2000). Loop shifting for loop compaction. International Journal of Parallel Programming, 28(5), 499\u2013534.","journal-title":"International Journal of Parallel Programming"},{"key":"220_CR7","first-page":"37","volume-title":"Design automation conference","author":"A. Dasdan","year":"1999","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":"220_CR8","first-page":"267","volume-title":"Resource-constrained project scheduling: models, algorithms, extensions and applications, control systems, robotics and manufacturing series","author":"B. Dupont\u00a0de\u00a0Dinechin","year":"2008","unstructured":"Dupont\u00a0de\u00a0Dinechin, B., Artiques, C., & Azem, S. (2008). Resource constrained modulo scheduling. In C. Artigues et al. (Eds.), Resource-constrained project scheduling: models, algorithms, extensions and applications, control systems, robotics and manufacturing series (pp.\u00a0267\u2013277) London: ISTE\/Wiley."},{"key":"220_CR9","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":"220_CR10","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 Scheduling theory and its applications. New York: Wiley."},{"key":"220_CR11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/155090.155115","volume-title":"Proceedings of the ACM SIGPLAN \u201993 conference on programming language design and implementation","author":"R. A. Huff","year":"1993","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)."},{"key":"220_CR12","first-page":"363","volume-title":"Practical applications of parallel computing: advances in computation theory and practice","author":"V. Kats","year":"2003","unstructured":"Kats, V. & Levner, E. (2003). Polynomial algorithms for periodic scheduling of tasks on parallel processors. In L. Yang & M. Paprzycki (Eds.), Practical applications of parallel computing: advances in computation theory and practice (Vol.\u00a012, pp. 363\u2013370). Nova Science, Canada."},{"issue":"7","key":"220_CR13","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.","journal-title":"SIGPLAN Notices"},{"key":"220_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01759032","volume":"6","author":"C. E. Leiserson","year":"1991","unstructured":"Leiserson, C. E., & Saxe, J. B. (1991). Retiming synchronous circuitry. Algorithmica, 6, 5\u201335.","journal-title":"Algorithmica"},{"key":"220_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(98)00054-7","volume":"87","author":"E. Levner","year":"1998","unstructured":"Levner, E., & Kats, V. (1998). A parametric critical path problem and an application for cyclic scheduling. Discrete Applied Mathematics, 87, 149\u2013158.","journal-title":"Discrete Applied Mathematics"},{"key":"220_CR16","doi-asserted-by":"crossref","first-page":"001","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. 001\u2013020). I-Tech Education and Publishing: Vienna."},{"key":"220_CR17","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/PACT.1996.554030","volume-title":"Proceedings of the conference on parallel architectures and compilation techniques","author":"J. Llosa","year":"1996","unstructured":"Llosa, J., Gonz\u00e1lez, A., Ayguad\u00e9, E., & Valero, M. (1996). Swing modulo scheduling: a lifetime-sensitive approach. In Proceedings of the conference on parallel architectures and compilation techniques (pp. 80\u201386), Boston."},{"key":"220_CR18","first-page":"367","volume-title":"IPCO","author":"A. Munier","year":"1998","unstructured":"Munier, A., Queyranne, M., & Schulz, A. S. (1998). Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In IPCO (pp. 367\u2013382)."},{"key":"220_CR19","volume-title":"Les r\u00e9seaux de Petri pour la conception et la gestion des syst\u00e8mes de production","author":"J. M. Proth","year":"1995","unstructured":"Proth, J. M., & Xie, X. (1995). Mod\u00e9lisation, analyse et optimisation des syst\u00e8mes \u00e0 fonctionnement cyclique. In Les r\u00e9seaux de Petri pour la conception et la gestion des syst\u00e8mes de production. Paris: Masson."},{"key":"220_CR20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/MICRO.1993.282754","volume-title":"MICRO 26: proceedings of the 26th annual international symposium on microarchitecture","author":"B. R. Rau","year":"1993","unstructured":"Rau, B. R. (1993). Dynamically scheduled VLIW processors. In MICRO 26: proceedings of the 26th annual international symposium on microarchitecture (pp. 80\u201392). Los Alamitos: IEEE Computer Society Press."},{"key":"220_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/192724.192731","volume-title":"MICRO 27: proceedings of the 27th annual international symposium on microarchitecture","author":"B. R. Rau","year":"1994","unstructured":"Rau, B. R. (1994). Iterative modulo scheduling: an algorithm for software pipelining loops. In MICRO 27: proceedings of the 27th annual international symposium on microarchitecture (pp. 63\u201374). New York: ACM."},{"key":"220_CR22","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. CRC: Boca Raton."},{"issue":"3","key":"220_CR23","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.","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-010-0220-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0220-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0220-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0220-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,8]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0220-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,8]]}}}