Full text
| |
| Author(s): |
Claudio Fabiano Motta Toledo
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Faculdade de Engenharia Elétrica e de Computação |
| Defense date: | 2005-06-09 |
| Examining board members: |
Paulo Morelato França;
Akebo Yamakami;
Franklina Maria Bragion de Toledo;
Maria do Socorro Nogueira Rangel;
Takaaki Ohishi
|
| Advisor: | Reinaldo Morabitto; Paulo Morelato França |
| Abstract | |
The present thesis establishes and solves a multi-Ievellot sizing and scheduling problem with parallel machines and sequence-dependent setup cost and time. The problem was motivated by a real situation found in some industrial settings mainly the soft drink industry. In this kind of industry, the production involves two interdependent levels with decisions about raw material storage and soft drink bottling. The several raw materiaIs are stored in tanks from which they ow to the bottling lines. The challenge is to determine simultaneously the lot sizing and scheduling of raw material in tanks and also in the bottling lines, where setup costs and time depend on the previous items stored and bottled. The objective is not only to provide an industrial problem solution, but also to establish and solve the problem by an academic point of view. Initially, a mathematical model is proposed with several combined constrains that use to be handled apart in the literature. This complex model was solved by the GAMS/Cplex software. The lack of similar models led us to create a set of instances to evaluate the model and the solution techniques developed. The exact model solution was possible only for small-sized instances because of the problem complexity. Therefore, meta-heuristics have been proposed and revealed as the only alternative to solve large instances. These methods have been able to provi de solutions with good quality in a reasonable computational time (AU) | |