A study on the cutting stock and production scheduling problem
Production planning integrated to the optimization problem of the use of moulds
An Linear Programming Approach for the cutting stock problem
Advanced search
The cutting stock problem with due date
Full text
| |
| Author(s): |
Elisama de Araújo Silva Oliveira
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica |
| Defense date: | 2016-12-14 |
| Examining board members: |
Kelly Cristina Poldi;
Carla Taviane Lucke da Silva Ghidini;
Silvio Alexandre de Araújo
|
| Advisor: | Kelly Cristina Poldi |
| Abstract | |
The Cutting Stock Problem (CSP) consists of cutting a set of objects available in stock to produce a set of items in specified amounts and lengths in order to optimize an objective function. Such problems have numerous industrial applications and have been extensively studied in the literature. In this dissertation, we treat the CSP one-dimensional with due date, ie, beyond the planning of the cutting patterns and their frequencies (how many times a cutting pattern should be cut) we are also interested in meeting the demand respecting the date of receipt of repleasing the requests. In this research, we study in details two mathematical models proposed by Reinertsen and Vossen and Arbib and Marinelli for the one-dimensional CSP with due dates. Moreover, we present two integer linear programing formulation for the CSP with due dates; the first one considers a single type of stock object avaliable in unlimited amount and the second one considers the problem with different types of stock objects available in limited amount. The mostly used aproach for solving cutting stock problems in the literatura is the simplex method with column generation proposed by Gilmore e Gomory; so, we applied the column generation technique to solve our proposed models. Computational experiments were carried on OPL/CPLEX in order to validate the proposed models. Keywords: cutting stock problem, due-date, linear programming, integer programming, column generation, mathematical modeling (AU) | |
| FAPESP's process: | 14/22570-6 - The cutting stock problem with due date |
| Grantee: | Elisama de Araújo Silva Oliveira |
| Support Opportunities: | Scholarships in Brazil - Master |