乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T13:20:10Z","timestamp":1711459210508},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13675-018-0100-3","type":"journal-article","created":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T08:24:18Z","timestamp":1532939058000},"page":"291-313","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A robust basic cyclic scheduling problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Idir","family":"Hamaz","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Houssin","sequence":"additional","affiliation":[]},{"given":"Sonia","family":"Cafieri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-018-0100-3_CR1","unstructured":"Ahuja RK (2017) Network flows: theory, algorithms, and applications, Pearson Education"},{"issue":"3","key":"10.1007\/s13675-018-0100-3_CR2","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10589-012-9499-2","article-title":"The resource-constrained modulo scheduling problem: an experimental study","volume":"54","author":"Ayala","year":"2013","journal-title":"Comput Optim Appl"},{"issue":"2","key":"10.1007\/s13675-018-0100-3_CR3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","article-title":"Adjustable robust solutions of uncertain linear programs","volume":"99","author":"Ben-Tal","year":"2004","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-018-0100-3_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The price of robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Oper Res"},{"issue":"13","key":"10.1007\/s13675-018-0100-3_CR5","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":"Discrete Appl Math"},{"issue":"1","key":"10.1007\/s13675-018-0100-3_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2003.03.001","article-title":"A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints","volume":"161","author":"Cavory","year":"2005","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0100-3_CR7","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.ejor.2014.06.047","article-title":"Robust optimization for the cyclic hoist scheduling problem","volume":"240","author":"Che","year":"2015","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0100-3_CR8","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":"1998","journal-title":"IEEE Trans Robot autom"},{"issue":"2","key":"10.1007\/s13675-018-0100-3_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s101070050058","article-title":"Negative-cycle detection algorithms","volume":"85","author":"Cherkassky","year":"1999","journal-title":"Math Program"},{"issue":"2-3","key":"10.1007\/s13675-018-0100-3_CR10","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":"Chretienne","year":"1991","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-018-0100-3_CR11","doi-asserted-by":"crossref","unstructured":"Cochet-Terrasson J, Cohen G, Gaubert S, McGettrick M, Quadrat J-P (1998) Numerical computation of spectral elements in max-plus algebra. In: Proceedings of the IFAC conference on system structure and control, Nantes","DOI":"10.1016\/S1474-6670(17)42067-2"},{"key":"10.1007\/s13675-018-0100-3_CR12","doi-asserted-by":"crossref","unstructured":"Cordeiro D, Mouni\u00e9 G, Perarnau S, Trystram D, Vincent J-M, Wagner F (2010) Random graph generation for scheduling simulations. In: Proceedings of the 3rd international ICST conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p 60","DOI":"10.4108\/ICST.SIMUTOOLS2010.8667"},{"issue":"4","key":"10.1007\/s13675-018-0100-3_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/1027084.1027085","article-title":"Experimental analysis of the fastest optimum cycle ratio and mean algorithms","volume":"9","author":"Dasdan","year":"2004","journal-title":"ACM Trans Des autom Electron Syst TODAES"},{"key":"10.1007\/s13675-018-0100-3_CR14","unstructured":"Dasdan A, Irani SS, Gupta RK (1998) An experimental study of minimum mean cycle algorithms. Technical report, 98-32, University of California, Irvine"},{"key":"10.1007\/s13675-018-0100-3_CR15","series-title":"Throughput optimization in robotic cells","author":"Dawande","year":"2007"},{"key":"10.1007\/s13675-018-0100-3_CR16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2011.09.015","article-title":"Robust location transportation problems under uncertain demands","volume":"164","author":"Gabrel","year":"2014","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-018-0100-3_CR17","series-title":"Graphs and algorithms","author":"Gondran","year":"1984"},{"issue":"11","key":"10.1007\/s13675-018-0100-3_CR18","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"},{"issue":"1","key":"10.1007\/s13675-018-0100-3_CR19","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: the recurrent job-shop","volume":"72","author":"Hanen","year":"1994","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-018-0100-3_CR20","series-title":"Scheduling theory and its applications","first-page":"194","article-title":"Cyclic scheduling on parallel processors: an overview","author":"Hanen","year":"1995"},{"issue":"5","key":"10.1007\/s13675-018-0100-3_CR21","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/mnsc.12.5.317","article-title":"Dynamic programming","volume":"12","author":"Howard","year":"1966","journal-title":"Manag Sci"},{"issue":"1","key":"10.1007\/s13675-018-0100-3_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jos.92","article-title":"Cyclic scheduling in a robotic production line","volume":"5","author":"Kats","year":"2002","journal-title":"J Sched"},{"key":"10.1007\/s13675-018-0100-3_CR23","series-title":"Encyclopedia of optimization","first-page":"3317","article-title":"Robust linear programming with right-hand-side uncertainty, duality and applications","author":"Minoux","year":"2008"},{"issue":"3","key":"10.1007\/s13675-018-0100-3_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","article-title":"On 2-stage robust LP with RHS uncertainty: complexity results and applications","volume":"49","author":"Minoux","year":"2011","journal-title":"J Global Optim"},{"issue":"3","key":"10.1007\/s13675-018-0100-3_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)00126-X","article-title":"The basic cyclic scheduling problem with linear precedence constraints","volume":"64","author":"Munier","year":"1996","journal-title":"Discrete Appl Math"},{"issue":"5","key":"10.1007\/s13675-018-0100-3_CR26","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","article-title":"Convex programming with set-inclusive constraints and applications to inexact linear programming","volume":"21","author":"Soyster","year":"1973","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0100-3_CR27","doi-asserted-by":"crossref","unstructured":"Sucha P, Pohl Z, Hanz\u00e1lek Z (2004) Scheduling of iterative algorithms on FPGA with pipelined arithmetic unit. In: Proceedings of the 10th IEEE Real-time and embedded technology and applications symposium, 2004. RTAS 2004. IEEE, pp 404\u2013412","DOI":"10.1109\/RTTAS.2004.1317287"},{"key":"10.1007\/s13675-018-0100-3_CR28","unstructured":"Thiele A, Terry T, Epelman M (2009) Robust linear optimization with recourse. Technical report"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0100-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0100-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0100-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:29:38Z","timestamp":1648632578000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S2192440621001040"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0100-3","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"1 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}