{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:39:45Z","timestamp":1771893585473,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"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,2]]},"DOI":"10.1007\/s10951-009-0159-z","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T20:11:28Z","timestamp":1265314288000},"page":"103-117","source":"Crossref","is-referenced-by-count":13,"title":["A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule"],"prefix":"10.1007","volume":"14","author":[{"given":"Alix","family":"Munier\u00a0Kordon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"159_CR1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0377-2217(94)90127-9","volume":"78","author":"R. Armstrong","year":"1994","unstructured":"Armstrong, R., Lei, L., & Gu, S. (1994). A bounding scheme for deriving the minimal cycle time of a single-transporter n-stage process with time-window constraints. European Journal of Operational Research, 78, 130\u2013140.","journal-title":"European Journal of Operational Research"},{"key":"159_CR2","volume-title":"Synchronisation and linearity: an algebra for discrete event systems","author":"F. Bacelli","year":"1992","unstructured":"Bacelli, F., Cohen, G., Olsder, G. J., & Quadrat, J.-P. (1992). Synchronisation and linearity: an algebra for discrete event systems. New York: Wiley."},{"key":"159_CR3","volume-title":"Graphes et hypergraphes","author":"C. Berge","year":"1970","unstructured":"Berge, C. (1970). Graphes et hypergraphes. Paris: Dunod."},{"key":"159_CR4","volume-title":"Probl\u00e8mes d\u2019ordonnancement : mod\u00e8lisation, complexit\u00e9, algorithmes","author":"J. Carlier","year":"1988","unstructured":"Carlier, J., & Chr\u00e9tienne, P. (1988). Probl\u00e8mes d\u2019ordonnancement : mod\u00e8lisation, complexit\u00e9, algorithmes. Paris: Masson."},{"key":"159_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2003.03.001","volume":"161","author":"G. Cavory","year":"2005","unstructured":"Cavory, G., Dupas, R., & Goncalves, G. (2005). A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. European Journal of Operational Research, 161, 73\u201385.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"159_CR6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/70.660860","volume":"14","author":"H. Chen","year":"1998","unstructured":"Chen, H., Chu, C., & Proth, J.-M. (1998). Cyclic schedule of a hoist with time window constraints. IEEE Transactions on Robotics and Automation, 14(1), 144\u2013152.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"159_CR7","first-page":"127","volume":"4","author":"P. Chr\u00e9tienne","year":"1985","unstructured":"Chr\u00e9tienne, P. (1985). Transient and limiting behavior of timed event graphs. RAIRO Techniques et Sciences Informatiques, 4, 127\u2013192.","journal-title":"RAIRO Techniques et Sciences Informatiques"},{"issue":"1","key":"159_CR8","first-page":"39","volume":"77","author":"G. Cohen","year":"1989","unstructured":"Cohen, G., Moller, P., Quadrat, J.-P., & Viot, M. (1989). Algebraic tools for the performance evaluation of discrete event systems. Discrete Event Dynamics Systems, 77(1), 39\u201358. IEEE proceeding: special issue.","journal-title":"Discrete Event Dynamics Systems"},{"key":"159_CR9","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., & Rivest, R. (1990). Introduction to algorithms. Cambridge: MIT Press."},{"key":"159_CR10","unstructured":"Cucu, L., & Sorel, Y. (2003). Schedulability condition for systems with precedence and periodicity constraints without preemption. In Proc. RTS2003 11th conference on real-time and embedded systems."},{"key":"159_CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0166-218X(99)00105-5","volume":"93","author":"D. Werra de","year":"1999","unstructured":"de Werra, D., Eisenbeis, C., Lelait, S., & Marmol, B. (1999). On a graph-theoretical model for cyclic register allocation. Discrete Applied Mathematics, 93, 191\u2013203.","journal-title":"Discrete Applied Mathematics"},{"key":"159_CR12","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"},{"issue":"11","key":"159_CR13","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/71.544355","volume":"7","author":"R. Govindarajan","year":"1996","unstructured":"Govindarajan, R., Altman, E., & Gao, G. R. (1996). A framework for resource-constrained rate-optimal software pipelining. IEEE Transactions on Parallel and Distributed Systems, 7(11), 1133\u20131149.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"159_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jos.100","volume":"5","author":"N. G. Hall","year":"2002","unstructured":"Hall, N. G., Lee, T.-E., & Posner, M. (2002). The complexity of cyclic scheduling problems. Journal of Scheduling, 5, 307\u2013327.","journal-title":"Journal of Scheduling"},{"key":"159_CR15","volume-title":"Scheduling theory and its applications","author":"C. Hanen","year":"1995","unstructured":"Hanen, C., & Munier, A. (1995). Cyclic scheduling on parallel processors: an overview. In P.\u00a0Chr\u00e9tienne, E.\u00a0G.\u00a0Coffman, J.\u00a0K.\u00a0Lenstra, & Z.\u00a0Liu (Eds.), Scheduling theory and its applications. New York: Wiley."},{"issue":"1","key":"159_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/9.8644","volume":"34","author":"H. Hillion","year":"1989","unstructured":"Hillion, H., & Proth, J.-M. (1989). Performance evaluation of a job-shop system using timed event graph. IEEE Transactions on Automatic Control, 34(1), 3\u20139.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"159_CR17","unstructured":"Lee, T.-E., & Lee, B.-S. (2005). An extension of negative event graphs for discrete event systems with general time constraints (Technical report). Department of Industrial Engineering, KAIST, August 2005."},{"key":"159_CR18","unstructured":"Lee, T.-E., Lee, H.-Y., & Sreenivas, R. S. (2006). Token delays and generalized workload balancing for timed evant graphs with application to cluster toll operation. In Proc. IEEE international conference on automation science and engineering (pp.\u00a093\u201399). Shanghai, China, October 2006."},{"issue":"4","key":"159_CR19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/TASE.2005.851236","volume":"2","author":"T.-E. Lee","year":"2005","unstructured":"Lee, T.-E., & Park, S.-H. (2005a). An extended event graph with negative places and tokens for time window constraints. IEEE Transactions on Automation Science and Engineering, 2(4), 319\u2013332.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"159_CR20","unstructured":"Lee, T.-E., & Park, S.-H. (2005b). Steady state analysis of a timed event graph with time window constraints. In Proc. IEEE international conference on automation science and engineering (pp.\u00a0404\u2013409). Edmonton, Canada, August 2005."},{"issue":"8","key":"159_CR21","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/0305-0548(93)90102-O","volume":"20","author":"L. Lei","year":"1993","unstructured":"Lei, L. (1993). An o(n 2log\u2009nlog\u2009b) algorithm for determining the optimal integer cyclic transportation schedule with a given route. Computers and Operation Research, 20(8), 807\u2013816.","journal-title":"Computers and Operation Research"},{"key":"159_CR22","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":"159_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0895-7177(94)90210-0","volume":"20","author":"T. McCormick","year":"1994","unstructured":"McCormick, T., & Rao, U. S. (1994). Some complexity results in cyclic scheduling. Mathematical and Computer Modelling, 20, 107\u2013122.","journal-title":"Mathematical and Computer Modelling"},{"key":"159_CR24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jos.95","volume":"5","author":"M. Middendorf","year":"2002","unstructured":"Middendorf, M., & Timkovsky, V. G. (2002). On scheduling cycle shops: Classification, complexity and approximation. Journal of Scheduling, 5, 135\u2013169.","journal-title":"Journal of Scheduling"},{"key":"159_CR25","doi-asserted-by":"crossref","unstructured":"Sucha, P., Pohl, Z., & Hanzalek, Z. (2004). Scheduling of iterative algorithms on fpga with pipelined arithmetic unit. In Proc. 10th IEEE real-time and embedded technology and applications symposium, RTAS (pp.\u00a0404\u2013412).","DOI":"10.1109\/RTTAS.2004.1317287"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0159-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0159-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0159-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0159-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["159"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0159-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}