{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:50:42Z","timestamp":1649130642780},"reference-count":30,"publisher":"FapUNIFESP (SciELO)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Prod."],"abstract":"<jats:p>Neste trabalho, apresentamos formula\u00e7\u00f5es monoest\u00e1gio para o problema integrado de dimensionamento e sequenciamento de lotes de produ\u00e7\u00e3o de bebidas dois est\u00e1gios com sincronia. O problema envolve m\u00faltiplos produtos, m\u00faltiplas m\u00e1quinas e tempos e custos de troca dependentes da sequ\u00eancia de produ\u00e7\u00e3o. As formula\u00e7\u00f5es monoest\u00e1gio apresentadas n\u00e3o t\u00eam perda de generalidade para representar o problema e, em geral, reduzem as dimens\u00f5es da formula\u00e7\u00e3o dois est\u00e1gios com sincronia apresentadas em Ferreira, Morabito e Rangel (2009) em termos dos n\u00fameros de vari\u00e1veis e restri\u00e7\u00f5es. Experimentos computacionais preliminares realizados com exemplares baseados em dados reais de uma f\u00e1brica de bebidas mostram que os modelos monoest\u00e1gio propostos s\u00e3o competitivos, quando comparados com o modelo anterior dois est\u00e1gios com sincronia.<\/jats:p>","DOI":"10.1590\/s0103-65132011005000068","type":"journal-article","created":{"date-parts":[[2013,2,9]],"date-time":"2013-02-09T12:42:22Z","timestamp":1360413742000},"page":"107-119","source":"Crossref","is-referenced-by-count":0,"title":["Formula\u00e7\u00f5es monoest\u00e1gio para o problema de programa\u00e7\u00e3o da produ\u00e7\u00e3o de bebidas dois est\u00e1gios com sincronia"],"prefix":"10.1590","volume":"23","author":[{"given":"Deisemara","family":"Ferreira","sequence":"first","affiliation":[{"name":"UFTM,  Brasil"}]},{"given":"Bernardo","family":"Almada-Lobo","sequence":"additional","affiliation":[{"name":"FEUP,  Portugal"}]},{"given":"Reinaldo","family":"Morabito","sequence":"additional","affiliation":[{"name":"UFSCar,  Brasil"}]}],"member":"530","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"issue":"3","key":"ref1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10589-009-9235-8","article-title":"Multiple machine continuous setup lotsizing with sequence-dependent setups","volume":"47","author":"ALMADA-LOBO B.","year":"2010","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"ref2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.ijpe.2007.02.052","article-title":"Production planning and scheduling in the glass container industry: A VNS approach","volume":"114","author":"ALMADA-LOBO B.","year":"2008","journal-title":"International Journal of Production Economics"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.cor.2006.05.010","article-title":"Lot-sizing and furnace scheduling in small foundries","volume":"35","author":"ARAUJO S.A.","year":"2008","journal-title":"Computers and Operations Research"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2004.01.054","article-title":"Single item lot sizing problems","volume":"168","author":"BRAHIMI N.etal","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"70-80","key":"ref5","article-title":"A programa\u00e7\u00e3o de lotes econ\u00f4micos de produ\u00e7\u00e3o (ELSP) com tempos e custos de setup dependentes da sequ\u00eancia: um estudo de caso","volume":"1","author":"CASTRO J.G.","year":"2005","journal-title":"Revista Gest\u00e3o Industrial"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","article-title":"A concise survey of scheduling with time-dependent processing time","volume":"152","author":"CHENG T.C.E.","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/S0360-8352(03)00073-1","article-title":"Hybrid heuristics for planning lot setups and sizes","volume":"45","author":"CLARK A.R","year":"2003","journal-title":"Computers & Industrial Engineering"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1080\/00207540050028106","article-title":"Rolling-horizon lot-sizing when set-up times are sequence-dependent","volume":"38","author":"CLARK A.R.","year":"2000","journal-title":"International Journal of Production Research"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10951-009-0135-7","article-title":"Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching","volume":"13","author":"CLARK A.R.","year":"2010","journal-title":"Journal of Scheduling"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","article-title":"Lot sizing and scheduling - survey and extensions","volume":"99","author":"DREXL A.","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"ref11","series-title":"Abordagens para o problema integrado de dimensionamento e sequenciamento de lotes da produ\u00e7\u00e3o de bebidas","author":"FERREIRA D.","year":"2006"},{"key":"ref12","first-page":"169","article-title":"Heuristics and metaheuristics for lot sizing and scheduling in the soft drinks industry: a comparison study, Studies in Computational Intelligence","volume":"128","author":"FERREIRA D.","year":"2008","journal-title":"Springer-Verlag Berlin Heidelberg"},{"issue":"1","key":"ref13","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1590\/S0103-65132008000100006","article-title":"Um modelo de otimiza\u00e7\u00e3o inteira mista e heur\u00edsticas relax and fix para a programa\u00e7\u00e3o da produ\u00e7\u00e3o de f\u00e1bricas de refrigerantes de pequeno porte","volume":"18","author":"FERREIRA D.","year":"2008","journal-title":"Produ\u00e7\u00e3o","ISSN":"http:\/\/id.crossref.org\/issn\/0103-6513","issn-type":"print"},{"issue":"2","key":"ref14","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.ejor.2008.03.035","article-title":"Solution approaches for the soft drink integrated production lot sizing and scheduling problem","volume":"196","author":"FERREIRA D.","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.cor.2009.06.007","article-title":"Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants","volume":"37","author":"FERREIRA D.","year":"2010","journal-title":"Computers & Operations Research"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01539800","article-title":"The general lotsizing and scheduling problem","volume":"19","author":"FLEISCHMANN B.","year":"1997","journal-title":"OR Spektrum"},{"key":"ref17","series-title":"AMPL - a modeling language for mathematical programming","author":"FOURER R.","year":"1993"},{"issue":"2","key":"ref18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0305-0483(98)00045-0","article-title":"A network flow model for capacitated lot sizing problem","volume":"27","author":"FRAN\u00c7A P.M","year":"1999","journal-title":"Omega-International Journal Of Management Science"},{"key":"ref19","series-title":"Using the CPLEX Callable Library","year":"2008"},{"issue":"5","key":"ref20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","article-title":"The capacitated lot sizing problem: a review of models and algorithms","volume":"31","author":"KARIMI B.","year":"2003","journal-title":"Omega International Journal of Management Science"},{"issue":"3","key":"ref21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1142\/S0217595909002286","article-title":"Combining process selection and lot sizing models for production scheduling of electrofused grains","volume":"26","author":"LUCHE J.R.","year":"2008","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","article-title":"On the job-shop scheduling problem","volume":"8","author":"MANNE A.S","year":"1960","journal-title":"Operations Research","ISSN":"http:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"ref23","series-title":"Scheduling: theory, algorithms and systems","author":"PINEDO M.","year":"1995"},{"issue":"2","key":"ref24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.5540\/tema.2003.04.02.0237","article-title":"Um modelo de dimensionamento de lotes para uma f\u00e1brica de refrigerantes","volume":"4","author":"RANGEL S.","year":"2003","journal-title":"TEMA - Tend\u00eancias em Matem\u00e1tica Aplicada e Computacional"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/S0377-2217(01)00196-5","article-title":"A lot-sizing problem in an automated foundry","volume":"139","author":"SANTOS-MEZA E.","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.ejor.2005.06.029","article-title":"A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines","volume":"175","author":"TOLEDO F.M.B.","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"ref27","doi-asserted-by":"crossref","first-page":"3097","DOI":"10.1080\/00207540701675833","article-title":"Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem","volume":"47","author":"TOLEDO C.F.M.","year":"2008","journal-title":"International Journal of Production Research"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1590\/S0101-74382007000100009","article-title":"Um modelo de otimiza\u00e7\u00e3o para o problema integrado de dimensionamento de lotes e programa\u00e7\u00e3o da produ\u00e7\u00e3o em f\u00e1brica de refrigerantes","volume":"27","author":"TOLEDO C.F.M.","year":"2007","journal-title":"Pesquisa Operacional","ISSN":"http:\/\/id.crossref.org\/issn\/0101-7438","issn-type":"print"},{"issue":"3","key":"ref29","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.cie.2009.02.011","article-title":"Lot sizing and sequencing optimization at an animal-feed plant","volume":"57","author":"TOSO E.V.","year":"2009","journal-title":"Computers & Industrial Engineering"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","article-title":"Valid inequalities for 0-1 knapsack and MIPs with generalized upper bound constraints","volume":"29","author":"WOLSEY L.A","year":"1990","journal-title":"Discrete Applied Mathematics"}],"container-title":["Production"],"original-title":[],"link":[{"URL":"http:\/\/www.scielo.br\/pdf\/prod\/v23n1\/aop_t6_0006_0384.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T22:51:44Z","timestamp":1520290304000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.scielo.br\/scielo.php?script=sci_arttext&pid=S0103-65132013000100008&lng=pt&tlng=pt"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,21]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,3]]}},"alternative-id":["S0103-65132013000100008"],"URL":"https:\/\/doi.org\/10.1590\/s0103-65132011005000068","relation":{},"ISSN":["1980-5411","0103-6513"],"issn-type":[{"value":"1980-5411","type":"electronic"},{"value":"0103-6513","type":"print"}],"subject":[],"published":{"date-parts":[[2011,11,21]]}}}