乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:20:00Z","timestamp":1720297200347},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1016\/j.cor.2014.03.004","type":"journal-article","created":{"date-parts":[[2014,3,17]],"date-time":"2014-03-17T18:16:09Z","timestamp":1395080169000},"page":"227-236","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Converging to periodic schedules for cyclic scheduling problems with resources and deadlines"],"prefix":"10.1016","volume":"51","author":[{"given":"Beno\u00eet","family":"Dupont de Dinechin","sequence":"first","affiliation":[]},{"given":"Alix","family":"Munier Kordon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.cor.2014.03.004_bib1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/212094.212131","article-title":"Software pipelining","volume":"23","author":"Allan","year":"1995","journal-title":"ACM Comput Surv"},{"issue":"1","key":"10.1016\/j.cor.2014.03.004_bib2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0377-2217(94)90127-9","article-title":"A bounding scheme for deriving the minimal cycle time of a single-transporter n-stage process with time-window constraints","volume":"78","author":"Armstrong","year":"1994","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.03.004_bib3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling","volume":"112","author":"Brucker","year":"1999","journal-title":"Eur J Oper Res"},{"issue":"13","key":"10.1016\/j.cor.2014.03.004_bib4","doi-asserted-by":"crossref","first-page":"2561","DOI":"10.1016\/j.dam.2008.03.029","article-title":"A general model for cyclic machine scheduling problems","volume":"156","author":"Brucker","year":"2008","journal-title":"Discret Appl Math"},{"issue":"1","key":"10.1016\/j.cor.2014.03.004_bib5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/70.660860","article-title":"Cyclic scheduling of a hoist with time window constraints","volume":"14","author":"Chen","year":"2002","journal-title":"IEEE Trans Robot Autom"},{"key":"10.1016\/j.cor.2014.03.004_bib6","unstructured":"Philippe Chr\u00e9tienne. Timed event graphs: a complete study of their controlled executions. In: International workshop on timed petri nets. Torino, Italy: IEEE Computer Society; July 1985. p. 47\u201354."},{"key":"10.1016\/j.cor.2014.03.004_bib7","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":"Discret Appl Math"},{"issue":"1","key":"10.1016\/j.cor.2014.03.004_bib8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/5.21069","article-title":"Algebraic tools for the performance evaluation of discrete event systems","volume":"77","author":"Cohen","year":"1989","journal-title":"IEEE Proc: Spec Issue Discret Event Syst"},{"key":"10.1016\/j.cor.2014.03.004_bib9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018995317468","article-title":"Cyclic scheduling in robotic flowshops","volume":"96","author":"Crama","year":"2000","journal-title":"Ann Oper Res"},{"key":"10.1016\/j.cor.2014.03.004_bib10","unstructured":"Liliana Cucu, Yves Sorel. Schedulability condition for systems with precedence and periodicity constraints without preemption. In: RTS2003 11th conference on real-time and embedded systems; 2003."},{"key":"10.1016\/j.cor.2014.03.004_bib11","unstructured":"Benoit Dupont de Dinechin. Time-indexed formulations and a large neighborhood search for the resource-constrained modulo scheduling problem. In: MISTA\u00d52007, 3rd multidisciplinary international scheduling conference: theory and applications; August 2007."},{"key":"10.1016\/j.cor.2014.03.004_bib12","series-title":"Resource-constrained project scheduling","first-page":"267","article-title":"Resource constrained modulo scheduling","author":"Dupont de Dinechin","year":"2008"},{"key":"10.1016\/j.cor.2014.03.004_bib13","doi-asserted-by":"crossref","unstructured":"Alexandre E. Eichenberger, Edward S. Davidson. Efficient formulation for optimal modulo schedulers. In: PLDI \u05f397: Proceedings of the ACM SIGPLAN 1997 conference on programming language design and implementation. New York, NY, USA: ACM; 1997. p. 194\u2013205.","DOI":"10.1145\/258915.258933"},{"key":"10.1016\/j.cor.2014.03.004_bib14","doi-asserted-by":"crossref","unstructured":"Paolo Faraboschi, Geoffrey Brown, Joseph A. Fisher, Giusseppe Desoli, Fred Homewood. Lx: a technology platform for customizable VLIW embedded processing. In: ISCA\u05f300: Proceedings of the 27th annual international symposium on computer architecture; 2000. p. 203\u201313.","DOI":"10.1145\/339647.339682"},{"key":"10.1016\/j.cor.2014.03.004_bib15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626494000363","article-title":"Generating close to optimum loop schedules on parallel processors","volume":"4","author":"Gasperoni","year":"1994","journal-title":"Parallel Process Lett"},{"issue":"11","key":"10.1016\/j.cor.2014.03.004_bib16","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/71.544355","article-title":"A framework for resource-constrained rate-optimal software pipelining","volume":"7","author":"Govindarajan","year":"1996","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"10.1016\/j.cor.2014.03.004_bib17","series-title":"Computer and job-shop scheduling theory","article-title":"Bounds on the performance of scheduling algorithms","author":"Graham","year":"1976"},{"key":"10.1016\/j.cor.2014.03.004_bib18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","article-title":"Study of a np-hard cyclic scheduling problem","volume":"72","author":"Hanen","year":"1994","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.03.004_bib19","series-title":"Scheduling theory and its applications","article-title":"Cyclic scheduling on parallel processors","author":"Hanen","year":"1994"},{"issue":"3","key":"10.1016\/j.cor.2014.03.004_bib20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TSM.2003.815203","article-title":"Scheduling analysis of time-constrained dual-armed cluster tools","volume":"16","author":"Kim","year":"2003","journal-title":"IEEE Trans Semicond Manuf"},{"key":"10.1016\/j.cor.2014.03.004_bib21","unstructured":"Chunho Lee, Miodrag Potkonjak, William H. Mangione-Smith. Mediabench: a tool for evaluating and synthesizing multimedia and communications systems. In: Proceedings of thirtieth annual IEEE\/ACM international symposium on microarchitecture, 1997; Dec 1997. p. 330\u201335."},{"issue":"October 4","key":"10.1016\/j.cor.2014.03.004_bib22","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/TASE.2005.851236","article-title":"An extended event graph with negative places and tokens for time window constraints","volume":"2","author":"Lee","year":"2005","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10.1016\/j.cor.2014.03.004_bib23","unstructured":"Tae-Eog Lee, Seong-Ho Park. Steady state analysis of a timed event graph with time window constraints. In: IEEE international conference on automation science and engineering, Edmonton, Canada; August 2005. p. 404\u20139."},{"issue":"2","key":"10.1016\/j.cor.2014.03.004_bib24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jos.95","article-title":"On scheduling cycle shops","volume":"5","author":"Middendorf","year":"2002","journal-title":"J Sched"},{"issue":"February","key":"10.1016\/j.cor.2014.03.004_bib25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10951-009-0159-z","article-title":"A graph-based analysis of the cyclic scheduling problem with time constraints","volume":"14","author":"MunierKordon","year":"2011","journal-title":"J Sched"},{"issue":"1","key":"10.1016\/j.cor.2014.03.004_bib26","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","article-title":"Multiproject scheduling with limited resources","volume":"16","author":"Alan","year":"1969","journal-title":"Manag Sci"},{"key":"10.1016\/j.cor.2014.03.004_bib27","unstructured":"Chander Ramchandani. Analysis of asynchronous concurrent systems by petri nets [Ph.D. thesis], Massachussets Institute of Technology, Cambridge, USA; 1973."},{"issue":"Feb 1","key":"10.1016\/j.cor.2014.03.004_bib28","first-page":"3","article-title":"Iterative modulo scheduling","volume":"24","author":"Ramakrishna Rau","year":"1996","journal-title":"Int J Parallel Process"},{"key":"10.1016\/j.cor.2014.03.004_bib29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10589-009-9239-4","article-title":"A cyclic scheduling problem with an undetermined number of parallel identical processors","volume":"48","author":"\u0160\u016fcha","year":"2011","journal-title":"Comput Optim Appl"},{"key":"10.1016\/j.cor.2014.03.004_bib30","unstructured":"Premsyl \u0160\u016fcha, Zdenek Pohl, Zdenek Hanz\u00e1lek. Scheduling of iterative algorithms on FPGA with pipelined arithmetic unit. In: 10th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS; 2004. p. 404\u201312."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054814000537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054814000537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T14:29:13Z","timestamp":1565274553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054814000537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":30,"alternative-id":["S0305054814000537"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2014.03.004","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Converging to periodic schedules for cyclic scheduling problems with resources and deadlines","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2014.03.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}