Atenção: Todas as denúncias são sigilosas e sua identidade será preservada.
Os campos nome e e-mail são de preenchimento opcional
Metadados | Descrição | Idioma |
---|---|---|
Autor(es): dc.contributor | Universidade de São Paulo (USP) | - |
Autor(es): dc.contributor | University of Lavras | - |
Autor(es): dc.contributor | Universidade Estadual Paulista (UNESP) | - |
Autor(es): dc.contributor | Universidade Federal de São Carlos (UFSCar) | - |
Autor(es): dc.creator | Toledo, Claudio F. M. | - |
Autor(es): dc.creator | Arantes, Marcio S. | - |
Autor(es): dc.creator | França, Paulo M. [UNESP] | - |
Autor(es): dc.creator | Morabito, Reinaldo | - |
Data de aceite: dc.date.accessioned | 2022-08-04T22:03:53Z | - |
Data de disponibilização: dc.date.available | 2022-08-04T22:03:53Z | - |
Data de envio: dc.date.issued | 2022-04-28 | - |
Data de envio: dc.date.issued | 2022-04-28 | - |
Data de envio: dc.date.issued | 2012-08-01 | - |
Fonte completa do material: dc.identifier | http://dx.doi.org/10.1007/978-3-642-23424-8_3 | - |
Fonte completa do material: dc.identifier | http://hdl.handle.net/11449/220110 | - |
Fonte: dc.identifier.uri | http://educapes.capes.gov.br/handle/11449/220110 | - |
Descrição: dc.description | This chapter presents a memetic framework for solving the Synchronized and Integrated Two-level Lot Sizing and Scheduling Problem (SITLSP). A set of algorithms from this framework is thoroughly evaluated. The SITLSP is a real-world problem typically found in soft drink plants, but its presence can also be seen in many other multi-level production processes. The SITLSP involves a two-level production process where lot sizing and scheduling decisions have to be made for raw material storage in tanks and soft drink bottling in various production lines. The work presented here extends a previously proposed memetic computing approach that combines a multi-population genetic algorithm with a threshold accepting heuristic. The novelty and its main contribution is the use of tabu search combined with the multi-population genetic algorithm as a method to solve the SITLSP. Two real-world problem sets, both provided by a leading market soft drink company, have been used for the computational experiments. The results show that the memetic algorithms proposed significantly outperform the previously reported solutions used for comparison. | - |
Descrição: dc.description | Institute of Mathematics and Computer Science University of Sao Paulo, Av. Trabalhador Sao-Carlense, 400 | - |
Descrição: dc.description | Department of Computer Science University of Lavras, C.P. 3037 | - |
Descrição: dc.description | Department of Mathematics Statistics and Computing UNESP, C.P. 266 | - |
Descrição: dc.description | Production Engineering Department Federal University of Sao Carlos, C.P. 676 | - |
Descrição: dc.description | Department of Mathematics Statistics and Computing UNESP, C.P. 266 | - |
Formato: dc.format | 59-93 | - |
Idioma: dc.language | en | - |
Relação: dc.relation | Variants of Evolutionary Algorithms for Real-World Applications | - |
???dc.source???: dc.source | Scopus | - |
Título: dc.title | A memetic framework for solving the lot sizing and scheduling problem in soft drink plants | - |
Aparece nas coleções: | Repositório Institucional - Unesp |
O Portal eduCAPES é oferecido ao usuário, condicionado à aceitação dos termos, condições e avisos contidos aqui e sem modificações. A CAPES poderá modificar o conteúdo ou formato deste site ou acabar com a sua operação ou suas ferramentas a seu critério único e sem aviso prévio. Ao acessar este portal, você, usuário pessoa física ou jurídica, se declara compreender e aceitar as condições aqui estabelecidas, da seguinte forma: