Advanced search
Start date
Betweenand

New formulations for the minimization open stacks problems and related

Grant number: 20/00747-2
Support Opportunities:Scholarships in Brazil - Post-Doctoral
Effective date (Start): April 01, 2020
Effective date (End): December 13, 2021
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal Investigator:Horacio Hideki Yanasse
Grantee:Mateus Pereira Martin
Host Institution: Instituto de Ciência e Tecnologia (ICT). Universidade Federal de São Paulo (UNIFESP). Campus São José dos Campos. São José dos Campos , SP, Brazil
Associated research grant:16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings, AP.TEM

Abstract

In this project, we address the Minimization of Open Stacks Problem (MOSP). This problem arises in the context of manufacturing systems in which objects are cut to produce items in the face of cutting patterns. When the production of an item type begins, a stack is opened, and it is closed only after the production of the last copy of the corresponding item type. The MOSP consists of sequencing the cutting patterns in order to minimize the number of open stacks, and thus indirectly reduce the costs of production, labor and machinery. In this new study, we propose to develop a new formulation for the MOSP based on a multi-commodity flow problem with additional constraints. To the best of our knowledge, there is no related work in the literature. We believe that this formulation can be developed, and that it is capable of generating stronger lower bounds compared to the models already existing in the literature, as well as solving larger problem instances. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (5)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
MARTIN, MATEUS; YANASSE, HORACIO HIDEKI; SALLES-NETO, LUIZ LEDUINO. Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. N/A, p. 26-pg., . (16/01860-1, 20/00747-2, 13/07375-0)
MARTIN, MATEUS; YANASSE, HORACIO HIDEKI; PINTO, MARIA JOSE. Mathematical models for the minimization of open stacks problem. International Transactions in Operational Research, . (13/07375-0, 20/00747-2, 16/01860-1)
MARTIN, MATEUS; MORABITO, REINALDO; MUNARI, PEDRO. Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, . (20/00747-2, 16/08039-1, 16/01860-1, 13/07375-0)
MARTIN, MATEUS; MORABITO, REINALDO; MUNARI, PEDRO. Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 60, n. 6, p. 20-pg., . (16/08039-1, 20/00747-2, 13/07375-0, 16/01860-1)
MARTIN, MATEUS; YANASSE, HORACIO HIDEKI; SANTOS, MARISTELA O.; MORABITO, REINALDO. Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. N/A, p. 22-pg., . (13/07375-0, 20/00747-2, 16/01860-1)

Please report errors in scientific publications list using this form.