A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines

Meyr, Herbert; Mann, Matthias

doi:10.1016/j.ejor.2013.03.036

Cited by 46 publications

(22 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The GLSPPL, General Lot Sizing and Scheduling Problem for Parallel Production Lines, proposed by Meyr (2002) and also studied in Meyr and Mann (2013), allows for adequate representation of the lot sizing and scheduling problems of harvest fronts in sugarcane mills, as shown in the present study. Therefore, it is possible to support key decisions about this problem and address specific issues and gaps in the balance between harvesting and transportation capacity, and the impact of the harvest front shifts on harvesting capacity.…”

Section: Introductionmentioning

confidence: 94%

“…To perform the modeling of the problem proposed, the GLSPPL was modified to represent the scheduling of sugarcane harvest fronts; it was used the GLSPPL with conservation of setup state, based on the studies conducted by Meyr (2002) and Meyr & Mann (2013), in which the products j would be the harvest blocks, and the production lines l would be the harvest fronts.…”

Section: Optimization Approaches Developmentmentioning

confidence: 99%

See 1 more Smart Citation

Abordagens de otimização para a programação e sequenciamento das frentes de colheita de cana-de-açúcar

Junqueira

Morábito

2017

Gest. Prod.

View full text Add to dashboard Cite

Resumo: A produção de açúcar, álcool e energia elétrica a partir de cana-de-açúcar passa necessariamente pela Abstract:The production of sugar, ethanol, and electricity from sugarcane necessarily involves harvesting and transportation of raw materials, which are expensive and complex operations that affect industrial efficiency. The present study proposes optimization approaches to support programming and scheduling harvest front decisions, based on considering the representation of the lot sizing and scheduling problem on parallel machines with sequence-dependent setup times and costs, a modeling technique widely reported in the literature. We carried out real data experiments in order to verify the adequacy and consistency of this representation. The results show that the proposed approaches adequately represent the conceptual model studied and have great potential to reduce cost in real-life situations.

show abstract

Section: Introductionmentioning

confidence: 94%

Section: Optimization Approaches Developmentmentioning

confidence: 99%

Abordagens de otimização para a programação e sequenciamento das frentes de colheita de cana-de-açúcar

Junqueira

Morábito

2017

Gest. Prod.

View full text Add to dashboard Cite

show abstract

“…Most of the relevant papers analyzed are related to the automotive sector. Several authors focus mainly on the balancing problem of the different process involved in the production lines and many others mainly focus of the production sequencing [9][10][11][12][13]. Another main focus of papers analysed in this field of high product mix and low-volume production systems is the line feeding problem.…”

Section: High Product MIX and Low-volume Production Manufacturing Sysmentioning

confidence: 99%

Production logistics design and development support through simulation-based optimization (WIP)

Zúñiga

Moris

Syberfeldt

2016

2016 Summer Computer Simulation Conference (SCSC 2016)

View full text Add to dashboard Cite

Manufacturing sectors in Sweden have a long history that leads to common non-optimized flows on the shop floor. Especially when having a really high product mix and a low-volume of customized products, a great deal of effort with respect to flow optimization is needed to stay present and compete in the globalized market. The goal of this project is to support the design and development of the implementation of new production systems and logistics flows considering the shop floor plant layout of a Swedish middle-size water pumps factory. In this paper, with the help of different types of simulation models and optimization, some results of a new technologically adapted production line are analyzed and relevant information and potential improvements in the production are found. The further development of optimization studies using the exiting simulation models is stated as ongoing and future work. The obtained and potential results can serve for decision makers and stakeholders to apply changes and adaptations in the system considering the mid and long term goals of the company.

show abstract

“…However, these studies either disregard the division into harvesting fronts or predefine it by harvest blocks. In a previous study, Junqueira & Morabito (2017) were inspired by the General Lotsizing and Scheduling Problem for Parallel Production Lines (GLSPPL) proposed by Meyr (2002) and Meyr & Mann (2013), which presents three models concerned with planning sugarcane harvesting considering harvesting fronts. According to the analogy used by the authors, the harvest blocks are represented by the GLSPPL lots, whereas the harvesting fronts are represented by the production lines.…”

Section: Introductionmentioning

confidence: 99%

Programação e sequenciamento das frentes de colheita de cana-de-açúcar: modelo e métodos de solução para problemas de grande porte

Junqueira

Morábito

2017

Gest. Prod.

View full text Add to dashboard Cite

Palavras-chave: Programação de colheita de cana-de-açúcar; Dimensionamento e sequenciamento de lotes de produção; Programação inteira mista; Heurísticas relax-and-fix e fix-and-optimize.Abstract: In a recent study, optimization models were proposed for programming and scheduling sugarcane harvesting fronts. This is a complex agricultural and logistic problem comprising various factors, such as raw material maturation stage, harvesting at the agricultural unit, transporting of raw material to the plant, and milling capacities of the plant. In this study, one of the optimization models previously studied was used to represent this problem using Mixed Integer Programming (MIP) of a lot sizing and scheduling model in parallel machines with sequence dependent setup times and costs. The proposed methods are based on MIP heuristics to solve this model in a real situation of a harvest season of a typical company from this sector inspired by harvest block aggregation heuristics, relax-and-fix constructive heuristics, and fix-and-optimize improvement heuristics. To compare the performance of the heuristic methods, various experiments were conducted using different combinations and variations of these methods. Three approaches were able to produce good quality solutions. One of them is described in detail and analyzed in this study, showing promising results in terms of making programming and scheduling decisions concerning sugarcane harvesting fronts.

show abstract

A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines

Cited by 46 publications

References 35 publications

Abordagens de otimização para a programação e sequenciamento das frentes de colheita de cana-de-açúcar

Abordagens de otimização para a programação e sequenciamento das frentes de colheita de cana-de-açúcar

Production logistics design and development support through simulation-based optimization (WIP)

Programação e sequenciamento das frentes de colheita de cana-de-açúcar: modelo e métodos de solução para problemas de grande porte

Contact Info

Product

Resources

About