{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:22:37Z","timestamp":1743088957422,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_14","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"137-153","source":"Crossref","is-referenced-by-count":1,"title":["Precedence Constraint Posting for Cyclic Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Michele","family":"Lombardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Bonfietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Benini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ayala, M., Artigues, C.: On integer linear programming formulations for the resource-constrained modulo scheduling problem (2010)","DOI":"10.1016\/j.endm.2010.05.025"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11823285_30","volume-title":"Euro-Par 2006 Parallel Processing","author":"F. Blachot","year":"2006","unstructured":"Blachot, F., de Dinechin, B.D., Huard, G.: SCAN: A heuristic for near-optimal software pipelining. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol.\u00a04128, pp. 289\u2013298. Springer, Heidelberg (2006)"},{"key":"14_CR3","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: Proc. of AAAI\/IAAI, pp. 742\u2013747 (2000)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-49481-2_36","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"A. Cesta","year":"1998","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Scheduling multi-capacitated resources under complex temporal constraints. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, p. 465. Springer, Heidelberg (1998)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: A Constraint-Based Method for Project Scheduling with Time Windows. Journal of Heuristics\u00a08(1), 109\u2013136 (2002)","journal-title":"Journal of Heuristics"},{"key":"14_CR6","first-page":"127","volume":"4","author":"P. Chr\u00e9tienne","year":"1985","unstructured":"Chr\u00e9tienne, P.: Transient and limiting behavior of timed event graphs. RAIRO Techniques et Sciences Informatiques\u00a04, 127\u2013192 (1985)","journal-title":"RAIRO Techniques et Sciences Informatiques"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/1027084.1027085","volume":"9","author":"A. Dasdan","year":"2004","unstructured":"Dasdan, A.: Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic\u00a09(4), 385\u2013418 (2004)","journal-title":"ACM Transactions on Design Automation of Electronic"},{"issue":"2","key":"14_CR8","first-page":"1","volume":"1","author":"B.D. de Dinechin","year":"2004","unstructured":"de Dinechin, B.D.: From machine scheduling to VLIW instruction scheduling. ST Journal of Research\u00a01(2), 1\u201335 (2004)","journal-title":"ST Journal of Research"},{"key":"14_CR9","volume-title":"Resource-Constrained Modulo Scheduling","author":"B.D. de Dinechin","year":"2010","unstructured":"de Dinechin, B.D., Artigues, C., Azem, S.: Resource-Constrained Modulo Scheduling, ch. 18. ISTE, London (2010)"},{"key":"14_CR10","first-page":"1016","volume-title":"Proc. of IJCAI","author":"D.L. Draper","year":"1999","unstructured":"Draper, D.L., Jonsson, A.K., Clements, D.P., Joslin, D.E.: Cyclic scheduling. In: Proc. of IJCAI, pp. 1016\u20131021. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/258916.258933","volume":"32","author":"A.E. Eichenberger","year":"1997","unstructured":"Eichenberger, A.E., Davidson, E.S.: Efficient formulation for optimal modulo schedulers. ACM SIGPLAN Notices\u00a032(5), 194\u2013205 (1997)","journal-title":"ACM SIGPLAN Notices"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Golberg, A.V., Tarjan, R.E., Werneck, R.F.: An experimental study of minimum mean cycle algorithms. In: Proc. of ALENEX. Citeseer (2009)","DOI":"10.1137\/1.9781611972894.1"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Ghamarian, A.H., Geilen, M., Stuijk, S., Basten, T., Theelen, B.D., Mousavi, M.R., Moonen, A.J.M., Bekooij, M.: Throughput Analysis of Synchronous Data Flow Graphs. In: Proc. of ACSD, pp. 25\u201336 (2006)","DOI":"10.1109\/ACSD.2006.33"},{"key":"14_CR14","volume-title":"Cyclic scheduling on parallel processors: an overview","author":"C. Hanen","year":"1994","unstructured":"Hanen, C., Munier, A.: Cyclic scheduling on parallel processors: an overview, ch. 4. Wiley, Chichester (1994)"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/S0377-2217(02)00136-4","volume":"144","author":"R. Heilmann","year":"2003","unstructured":"Heilmann, R.: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research\u00a0144(2), 348\u2013365 (2003)","journal-title":"European Journal of Operational Research"},{"key":"14_CR16","volume-title":"Dynamic Programming and Markov Processes","author":"R.A. Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. Wiley, New York (1960)"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.3230130103","volume":"13","author":"G. Igelmund","year":"1983","unstructured":"Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks\u00a013(1), 29\u201348 (1983)","journal-title":"Networks"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230130102","volume":"13","author":"G. Igelmund","year":"1983","unstructured":"Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks\u00a013(1), 1\u201328 (1983)","journal-title":"Networks"},{"key":"14_CR19","unstructured":"Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: Proc. of IJCAI, pp. 181\u2013186. Professional Book Center (2005)"},{"key":"14_CR20","first-page":"318","volume-title":"Proc. of ACM SIGPLAN 1988","author":"M. Lam","year":"1988","unstructured":"Lam, M.: Software pipelining: An effective scheduling technique for VLIW machines. In: Proc. of ACM SIGPLAN 1988, vol.\u00a023, pp. 318\u2013328. ACM, New York (1988)"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0895-7177(94)90210-0","volume":"20","author":"S.T. McCormick","year":"1994","unstructured":"McCormick, S.T., Rao, U.S.: Some complexity results in cyclic scheduling. Mathematical and Computer Modelling\u00a020(2), 107\u2013122 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"14_CR22","first-page":"1923","volume-title":"Proc. of ISCAS","author":"K.K. Parhi","year":"1989","unstructured":"Parhi, K.K., Messerschmitt, D.G.: Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs. In: Proc. of ISCAS, vol.\u00a0217, pp. 1923\u20131928. IEEE, Los Alamitos (1989)"},{"issue":"3","key":"14_CR23","first-page":"163","volume":"20","author":"N. Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling. AI Communications\u00a020(3), 163\u2013180 (2007)","journal-title":"AI Communications"},{"key":"14_CR24","unstructured":"Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating Robust Schedules through Temporal Flexibility. In: Proc. of ICAPS, pp. 209\u2013218 (2004)"},{"key":"14_CR25","first-page":"63","volume-title":"Proc. of MICRO","author":"B.R. Rau","year":"1994","unstructured":"Rau, B.R.: Iterative modulo scheduling: An algorithm for software pipelining loops. In: Proc. of MICRO, pp. 63\u201374. ACM, New York (1994)"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"N. Young","year":"2002","unstructured":"Young, N., Tarjan, R., Orlin, J.: Faster Parametric Shortest Path and Minimum Balance Algorithms. Networks\u00a021, 205\u2013221 (2002)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T11:19:48Z","timestamp":1741173588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}