Abstract
Resource constrained cyclic scheduling problems consist in planning the execution over limited resources of a set of activities, to be indefinitely repeated. In such a context, the iteration period (i.e. the difference between the completion time of consecutive iterations) naturally replaces the makespan as a quality measure; exploiting inter-iteration overlapping is the primary method to obtain high quality schedules. Classical approaches for cyclic scheduling rely on the fact that, by fixing the iteration period, the problem admits an integer linear model. The optimal solution is then usually obtained iteratively, via linear or binary search on the possible iteration period values. In this paper we follow an alternative approach and provide a port of the key Precedence Constraint Posting ideas in a cyclic scheduling context; the value of the iteration period is not a-priori fixed, but results from conflict resolution decisions. A heuristic search method based on Iterative Flattening is used as a practical demonstrator; this was tested over instances from an industrial problem obtaining encouraging results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ayala, M., Artigues, C.: On integer linear programming formulations for the resource-constrained modulo scheduling problem (2010)
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. 4128, pp. 289–298. Springer, Heidelberg (2006)
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–747 (2000)
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. 1520, p. 465. Springer, Heidelberg (1998)
Cesta, A., Oddi, A., Smith, S.F.: A Constraint-Based Method for Project Scheduling with Time Windows. Journal of Heuristics 8(1), 109–136 (2002)
Chrétienne, P.: Transient and limiting behavior of timed event graphs. RAIRO Techniques et Sciences Informatiques 4, 127–192 (1985)
Dasdan, A.: Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic 9(4), 385–418 (2004)
de Dinechin, B.D.: From machine scheduling to VLIW instruction scheduling. ST Journal of Research 1(2), 1–35 (2004)
de Dinechin, B.D., Artigues, C., Azem, S.: Resource-Constrained Modulo Scheduling, ch. 18. ISTE, London (2010)
Draper, D.L., Jonsson, A.K., Clements, D.P., Joslin, D.E.: Cyclic scheduling. In: Proc. of IJCAI, pp. 1016–1021. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Eichenberger, A.E., Davidson, E.S.: Efficient formulation for optimal modulo schedulers. ACM SIGPLAN Notices 32(5), 194–205 (1997)
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)
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–36 (2006)
Hanen, C., Munier, A.: Cyclic scheduling on parallel processors: an overview, ch. 4. Wiley, Chichester (1994)
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 144(2), 348–365 (2003)
Howard, R.A.: Dynamic Programming and Markov Processes. Wiley, New York (1960)
Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13(1), 29–48 (1983)
Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13(1), 1–28 (1983)
Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: Proc. of IJCAI, pp. 181–186. Professional Book Center (2005)
Lam, M.: Software pipelining: An effective scheduling technique for VLIW machines. In: Proc. of ACM SIGPLAN 1988, vol. 23, pp. 318–328. ACM, New York (1988)
McCormick, S.T., Rao, U.S.: Some complexity results in cyclic scheduling. Mathematical and Computer Modelling 20(2), 107–122 (1994)
Parhi, K.K., Messerschmitt, D.G.: Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs. In: Proc. of ISCAS, vol. 217, pp. 1923–1928. IEEE, Los Alamitos (1989)
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 20(3), 163–180 (2007)
Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating Robust Schedules through Temporal Flexibility. In: Proc. of ICAPS, pp. 209–218 (2004)
Rau, B.R.: Iterative modulo scheduling: An algorithm for software pipelining loops. In: Proc. of MICRO, pp. 63–74. ACM, New York (1994)
Young, N., Tarjan, R., Orlin, J.: Faster Parametric Shortest Path and Minimum Balance Algorithms. Networks 21, 205–221 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardi, M., Bonfietti, A., Milano, M., Benini, L. (2011). Precedence Constraint Posting for Cyclic Scheduling Problems. In: Achterberg, T., Beck, J.C. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2011. Lecture Notes in Computer Science, vol 6697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21311-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-21311-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21310-6
Online ISBN: 978-3-642-21311-3
eBook Packages: Computer ScienceComputer Science (R0)