Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning

Full text
Author(s):
Toscano, Alyne [1] ; Ferreira, Deisemara [2] ; Morabito, Reinaldo [3]
Total Authors: 3
Affiliation:
[1] Univ Fed Triangulo Mineiro, Dept Prod Engn, Uberaba, MG - Brazil
[2] Univ Fed Sao Carlos, Dept Phys Chem & Math, Sorocaba, SP - Brazil
[3] Univ Fed Sao Carlos, Dept Prod Engn, Sao Carlos, SP - Brazil
Total Affiliations: 3
Document type: Journal article
Source: FLEXIBLE SERVICES AND MANUFACTURING JOURNAL; v. 31, n. 1, p. 142-173, MAR 2019.
Web of Science Citations: 0
Abstract

This paper presents a study on the fruit-based beverage lot sizing and scheduling problem. This is a two-stage lot-scheduling problem with some features, such as the presence of buffers between the production stages, mandatory temporal cleanings for the preparation tanks (stage I) and production lines (stage II), and production synchronization between the production stages. To solve this problem, we propose two variations of a two-phase heuristic algorithm by devising a production stage decomposition scheme coupled with a constructive procedure. In the first phase, a one-stage lot sizing is solved by a mixed integer programming model, and in the second phase, scheduling and the synchrony between the stages are carried out using a constructive algorithm. The two variations of the heuristic are: Stage I Heuristics (S1H) and Stage II Heuristics (S2H). In S1H, production stage I is solved by a mathematical model and in S2H, production stage II is solved by another mathematical model. Data from a typical beverage company of a large worldwide brand was used in the computational tests. The results showed that the heuristics are able to find competitive solutions very quickly and that the S2H heuristic performs better than S1H. (AU)

FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants