{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:25:19Z","timestamp":1761895519239},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,24]],"date-time":"2012-07-24T00:00:00Z","timestamp":1343088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10589-012-9499-2","type":"journal-article","created":{"date-parts":[[2012,7,23]],"date-time":"2012-07-23T15:11:44Z","timestamp":1343056304000},"page":"645-673","source":"Crossref","is-referenced-by-count":11,"title":["The resource-constrained modulo scheduling problem: an experimental study"],"prefix":"10.1007","volume":"54","author":[{"given":"Maria","family":"Ayala","sequence":"first","affiliation":[]},{"given":"Abir","family":"Benabid","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,24]]},"reference":[{"key":"9499_CR1","doi-asserted-by":"crossref","unstructured":"Ayala, M., Artigues, C.: On integer linear programming formulations for the resource-constrained modulo scheduling problem. Technical Report 10393, LAAS-CNRS, Toulouse, France (2010)","DOI":"10.1016\/j.endm.2010.05.025"},{"issue":"3","key":"9499_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.: Software pipelining. ACM Comput. Surv. 27(3), 367\u2013432 (1995)","journal-title":"ACM Comput. Surv."},{"key":"9499_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Euro-Par 2006 Parallel Processing","author":"F. Blachot","year":"2006","unstructured":"Blachot, F., Dupont\u00a0de\u00a0Dinechin, B., Huard, G.: A heuristic for near-optimal software pipelining. In: Euro-Par 2006 Parallel Processing. Lecture Notes in Computer Science (2006)"},{"issue":"1","key":"9499_CR4","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.: Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9499_CR5","volume-title":"MISTA 09: Proceedings of the 4th Multidisciplinary International Scheduling Conference","author":"A. Benabid","year":"2009","unstructured":"Benabid, A., Hanen, C.: Decomposed software pipelining for cyclic unitary RCPSP with precedence delays. In: MISTA 09: Proceedings of the 4th Multidisciplinary International Scheduling Conference (2009)"},{"key":"9499_CR6","volume-title":"ROADEF","author":"A. Benabid","year":"2009","unstructured":"Benabid, A., Hanen, C.: Modulo scheduling for unitary resource constrained cyclic problems. In: ROADEF (2009)"},{"key":"9499_CR7","volume-title":"ISCO: International Symposium on Combinatorial Optimization","author":"A. Benabid","year":"2010","unstructured":"Benabid, A., Hanen, C.: Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors. In: ISCO: International Symposium on Combinatorial Optimization (2010)"},{"key":"9499_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-642-23786-7_12","volume-title":"17th International Conference on Principles and Practice of Constraint Programming, CP\u00a02011","author":"A. Bonfietti","year":"2011","unstructured":"Bonfietti, A., Lombardi, M., Benini, L., Milano, M.: A constraint based approach to cyclic rcpsp. In: Lee, J. (ed.) 17th International Conference on Principles and Practice of Constraint Programming, CP\u00a02011. Lecture Notes in Computer Science, vol. 6876, pp. 130\u2013144. Springer, Berlin (2011)"},{"key":"9499_CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N. Christofides","year":"1987","unstructured":"Christofides, N., Alvarez-Vald\u00e9s, R., Tamarit, J.: Project scheduling with resource constraints: a branch and bound approach. Eur. J. Oper. Res. 29, 262\u2013273 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9499_CR10","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.: Circuit retiming applied to decomposed software pipelining. IEEE Trans. Parallel Distrib. Syst. 9(1), 24\u201335 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9499_CR11","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.: Circuit retiming applied to decomposed software pipelining. IEEE Trans. Parallel Distrib. Syst. 9(1), 24\u201335 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9499_CR12","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/92.335014","volume":"2","author":"S. Chaudhuri","year":"1994","unstructured":"Chaudhuri, S., Walker, R.A., Mitchell, J.E.: Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem. IEEE Trans. Very Large Scale Integr. Syst. 2, 456\u2013471 (1994)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"9499_CR13","isbn-type":"print","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., Artigues, C., Azem, S.: Resource-constrained modulo scheduling. In: Artigues, C., Demassey, S., N\u00e9ron, E. (eds.) Resource Constrained Project Scheduling: Models, Algorithms, Extensions and Applications, Control Systems, Robotics and Manufacturing Series, pp. 267\u2013277. ISTE, New York (2008). ISBN 978-1-84821-034-9","ISBN":"http:\/\/id.crossref.org\/isbn\/9781848210349"},{"key":"9499_CR14","first-page":"2","volume":"1","author":"B. Dupont\u00a0de\u00a0Dinechin","year":"2004","unstructured":"Dupont\u00a0de\u00a0Dinechin, B.: From machine scheduling to vliw instruction scheduling. ST J. Res. 1, 2 (2004)","journal-title":"ST J. Res."},{"key":"9499_CR15","first-page":"415","volume-title":"Lecture Notes in Computer Science","author":"A. Darte","year":"2000","unstructured":"Darte, A., Huard, G.: Loop shifting for loop compaction. In: Lecture Notes in Computer Science, vol.\u00a01863, pp. 415\u2013431 (2000)"},{"issue":"5","key":"9499_CR16","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1023\/A:1007506711786","volume":"28","author":"A. Darte","year":"2000","unstructured":"Darte, A., Huard, G.: Loop shifting for loop compaction. Int. J. Parallel Program. 28(5), 499\u2013534 (2000)","journal-title":"Int. J. Parallel Program."},{"key":"9499_CR17","volume-title":"SIGPLAN, PLDI\u201997","author":"A. Eichenberger","year":"1997","unstructured":"Eichenberger, A., Davidson, E.S.: Efficient formulation for optimal modulo schedulers. In: SIGPLAN, PLDI\u201997 (1997)"},{"key":"9499_CR18","volume-title":"27th Annual International Symposium on Microarchitecture","author":"A. Eichenberger","year":"1994","unstructured":"Eichenberger, A., Davidson, E.S., Abraham, S.G.: Minimum register requirements for a modulo schedule. In: 27th Annual International Symposium on Microarchitecture (1994)"},{"key":"9499_CR19","first-page":"203","volume-title":"27th Annual International Symposium on Computer Architecture","author":"P. Faraboschi","year":"2000","unstructured":"Faraboschi, P., Brown, G., Fisher, J.A., Desoli, G., Homewood, F.: Lx: a technology platform for customizable VLIW embedded processing. In: 27th Annual International Symposium on Computer Architecture, pp. 203\u2013213 (2000)"},{"key":"9499_CR20","volume-title":"Graphes et algorithmes","author":"M. Gondran","year":"1985","unstructured":"Gondran, M., Minoux, M.: Graphes et algorithmes. Eyrolles, Paris (1985)"},{"key":"9499_CR21","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626494000363","volume":"4","author":"F. Gasperoni","year":"1994","unstructured":"Gasperoni, F., Schwiegelshohn, U.: Generating close to optimum loop schedules on parallel processors. Parallel Process. Lett. 4, 391\u2013403 (1994)","journal-title":"Parallel Process. Lett."},{"key":"9499_CR22","volume-title":"Scheduling Theory and Its Applications","author":"C. Hanen","year":"1994","unstructured":"Hanen, C., Munier, A.: Cyclic scheduling on parallel processors: an overview. In: Chr\u00e9tienne, P., Coffman, E.G., Lenstra, J.K., Liu, Z. (eds.) Scheduling Theory and Its Applications. Wiley, New York (1994)"},{"key":"9499_CR23","unstructured":"Leiserson, C.E., Saxe, J.B.: Retiming synchronous circuitry. NASA STI\/Recon Technical Report No. 89:17797 (1988)"},{"key":"9499_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A. Pritsker","year":"1969","unstructured":"Pritsker, A., Watters, L., Wolfe, P.: Multi-project scheduling with limited resources: a zero-one programming approach. Manag. Sci. 16, 93\u2013108 (1969)","journal-title":"Manag. Sci."},{"key":"9499_CR25","first-page":"80","volume-title":"MICRO 26: Proceedings of the 26th Annual International Symposium on Microarchitecture","author":"B. Ramakrishna Rau","year":"1993","unstructured":"Ramakrishna Rau, B.: Dynamically scheduled VLIW processors. In: MICRO 26: Proceedings of the 26th Annual International Symposium on Microarchitecture, pp. 80\u201392. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"9499_CR26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MICRO.1994.717412","volume-title":"MICRO 27: Proceedings of the 27th Annual International Symposium on Microarchitecture","author":"B. Ramakrishna Rau","year":"1994","unstructured":"Ramakrishna Rau, B.: Iterative modulo scheduling: an algorithm for software pipelining loops. In: MICRO 27: Proceedings of the 27th Annual International Symposium on Microarchitecture, pp. 63\u201374. ACM, New York (1994)"},{"key":"9499_CR27","volume-title":"Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications","author":"S. Rajagopalan","year":"2002","unstructured":"Rajagopalan, S., Sharad, M.: Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. CRC Press, Boca Raton (2002)"},{"issue":"2","key":"9499_CR28","first-page":"99","volume":"6","author":"J. Sankaran","year":"1999","unstructured":"Sankaran, J., Bricker, D., Juang, S.: A strong fractional cutting-plane algorithm for resource-constrained project scheduling. Int. J. Ind. Eng. 6(2), 99\u2013111 (1999)","journal-title":"Int. J. Ind. Eng."},{"key":"9499_CR29","volume-title":"International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization","author":"M. Smelyanskiy","year":"2004","unstructured":"Smelyanskiy, M., Mahlke, S., Davidson, E.S.: Probabilistic predicate-aware modulo scheduling. In: International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization (2004)"},{"issue":"1","key":"9499_CR30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10589-009-9239-4","volume":"48","author":"P. \u0160\u016fcha","year":"2011","unstructured":"\u0160\u016fcha, P., Hanz\u00e0lek, Z.: A cyclic scheduling problem with an undetermined number of parallel identical processors. Comput. Optim. Appl. 48(1), 71\u201390 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9499_CR31","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018917426360","volume":"81","author":"Y. Zinder","year":"1998","unstructured":"Zinder, Y., Roper, D.: An iterative algorithm for scheduling unit-time operations with precedence constraints to minimise the maximum lateness. Ann. Oper. Res. 81, 321\u2013340 (1998)","journal-title":"Ann. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9499-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9499-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9499-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T11:40:22Z","timestamp":1714218022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9499-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,24]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9499"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9499-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,24]]}}}