{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:37:38Z","timestamp":1781714258018,"version":"3.54.5"},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6741,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0166-218x(94)00102-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:02:29Z","timestamp":1027648949000},"page":"167-192","source":"Crossref","is-referenced-by-count":41,"title":["A study of the cyclic scheduling problem on parallel processors"],"prefix":"10.1016","volume":"57","author":[{"given":"Claire","family":"Hanen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alix","family":"Munier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00102-J_BIB1","series-title":"Proceedings of the SIGPLAN' 88 Conference on Prog. Language Design and Implementation","first-page":"308","article-title":"Optimal loop parallelization","author":"Aiken","year":"1988"},{"key":"10.1016\/0166-218X(94)00102-J_BIB2","series-title":"Les Probl\u00e8mes d'Ordonnancement","author":"Carlier","year":"1988"},{"key":"10.1016\/0166-218X(94)00102-J_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(91)90037-W","article-title":"The basic cyclic scheduling problem with deadlines","volume":"30","author":"Chr\u00e9tienne","year":"1991","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/0166-218X(94)00102-J_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TAC.1985.1103925","article-title":"A linear system theoretic view of discrete event process and its use for performance evaluation in manufacturing","volume":"30","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/0166-218X(94)00102-J_BIB5","series-title":"Proceedings of the ACM International Conference on Super-computing","first-page":"453","article-title":"Optimization of horizontal microcode generation for loop structures","author":"Eisenbeis","year":"1988"},{"key":"10.1016\/0166-218X(94)00102-J_BIB6","series-title":"Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism IFIPWG 10.3","article-title":"Decomposed software pipelining: a new approach to exploit instruction level parallelism for loop programs","author":"Eisenbeis","year":"1993"},{"key":"10.1016\/0166-218X(94)00102-J_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)00102-J_BIB8","article-title":"Efficient algorithms for cyclic scheduling","author":"Gasperoni","year":"1991","journal-title":"IBM Technical report RC17068"},{"key":"10.1016\/0166-218X(94)00102-J_BIB9","doi-asserted-by":"crossref","unstructured":"C. Hanen, Study of a NP-hard cyclic scheduling problem: the recurrent job-shop, European J. Oper. Res., to appear.","DOI":"10.1016\/0377-2217(94)90332-8"},{"key":"10.1016\/0166-218X(94)00102-J_BIB10","article-title":"Performance evaluation of job-shop systems using timed event graphs","volume":"1","author":"Hillion","year":"1989","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/0166-218X(94)00102-J_BIB11","series-title":"Proceedings of the SIGPLAN' 88 Conference on Prog. Language Design and Implementation","first-page":"318","article-title":"Software pipelining: an effective scheduling technique for VLIW machines","author":"Lam","year":"1988"},{"key":"10.1016\/0166-218X(94)00102-J_BIB12","article-title":"Scheduling with deadlines and loss functions","volume":"12","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)00102-J_BIB13","article-title":"Cyclic sequencing problems in the two machines permutation flowshop: complexity, worst case and average case analysis","volume":"88","author":"Matsuo","year":"1988"},{"issue":"2","key":"10.1016\/0166-218X(94)00102-J_BIB14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1051\/ro\/1991250201611","article-title":"R\u00e9solution d'un probl\u00e8me d'ordonnancement cyclique \u00e0 it\u00e9rations ind\u00e9pendantes et constraintes de ressource","volume":"25","author":"Munier","year":"1991","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(94)00102-J_BIB15","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/0219051","article-title":"Scheduling loops on processors, algorithms and complexity","volume":"19","author":"Munshi","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)00102-J_BIB16","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/12.73588","article-title":"Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding","volume":"40","author":"Parhi","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00102-J_BIB17","doi-asserted-by":"crossref","DOI":"10.1287\/moor.17.4.842","article-title":"Cyclic schedules for job-shops with identical jobs","author":"Roundy","year":"1992","journal-title":"Math Oper. Res."},{"key":"10.1016\/0166-218X(94)00102-J_BIB18","article-title":"A mathematical model for periodic scheduling problems","volume":"2\u20134","author":"Serafini","year":"1989","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400102J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400102J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:54:49Z","timestamp":1555300489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400102J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0166218X9400102J"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00102-j","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}