Toledo, Claudio Fabiano MottaFrança, Paulo Morelato [UNESP]Rosa, Kalianne Almeida2014-05-272014-05-272008-12-01Proceedings of the ACM Symposium on Applied Computing, p. 1777-1781.http://hdl.handle.net/11449/70688This paper studies the use of different population structures in a Genetic Algorithm (GA) applied to lot sizing and scheduling problems. The population approaches are divided into two types: single-population and multi-population. The first type has a non-structured single population. The multi-population type presents non-structured and structured populations organized in binary and ternary trees. Each population approach is tested on lot sizing and scheduling problems found in soft drink companies. These problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. Computational results are reported allowing determining the better population structure for the set of problem instances evaluated. Copyright 2008 ACM.1777-1781engGenetic algorithmsLot sizingMulti-populationSchedulingSoft drink companyBeveragesBinary treesComputational methodsDiesel enginesComputational resultsIn linesMaterial storagesPopulation structuresProblem instancesScheduling problemsTernary treesTwo typesScheduling algorithmsTrabalho apresentado em evento10.1145/1363686.1364114Acesso aberto2-s2.0-56749169614