Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Ferreira, Deisemara; Morábito, Reinaldo; Rangel, Socorro

doi:10.1016/j.cor.2009.06.007

Cited by 82 publications

(63 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Regarding the problem, the production bottleneck alternates between the liquid preparation stage and the bottling one, therefore synchronization of the production between these stages is required. Other related studies appear in Ferreira et al (2010Ferreira et al ( , 2012 and Defalque et al (2011). Leite (2008) is the only study found in the literature review that deals with the production problem of a line of fruit beverages.…”

Section: Introductionmentioning

confidence: 99%

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

2016

Self Cite

View full text Add to dashboard Cite

ResumoNeste estudo, considera-se um problema de dimensionamento e programação de lotes de produção de bebidas não alcoólicas à base de frutas. O problema é caracterizado por horizonte de planejamento com múltiplos períodos, processo de produção com máquinas distintas, restrições de capacidades de produção e tempos de preparação das máquinas independentes da sequência de produção, além de condições especiais de preparações, como limpezas obrigatórias das máquinas dentro de limitações de tempo de produção. Para tratar o problema, propõe-se uma abordagem de solução baseada em modelos de programação matemática e uso de softwares de otimização. Os modelos são modificações de modelos de programação linear inteira mista conhecidos na literatura de dimensionamento e programação de lotes de produção. Porém, ao invés de considerar múltiplas máquinas em paralelo, os modelos propostos exploram outras possíveis configurações de máquinas para representar apropriadamente os processos de produção envolvidos na produção de bebidas à base de frutas. A abordagem proposta é validada por meio de um estudo realizado em uma fábrica de sucos e néctares de frutas no interior do Estado de São Paulo, em que as soluções obtidas pelos modelos foram testadas e analisadas em situações realistas da empresa. Os resultados mostram que a abordagem tem bom potencial de aplicação prática. Palavras-chave: Indústria de bebidas não alcoólicas; Planejamento da produção; Programação inteira mista; Dimensionamento de lotes. AbstractThis study considers a production lot-sizing and scheduling problem of non-alcoholic fruit juice beverages. The problem is characterized by a multi-period planning horizon, a production process with different machines, capacity constraints and setup times independent from the production sequence, as well as special conditions regarding required machines clean-in-place (CIP) within production time periods. To deal with this problem, we propose a solution approach based on mathematical programming and using optimization software. The models are modifications of mixed integer programming models known in the lot sizing and scheduling literature. However, instead of considering multiple parallel machines, the proposed models explore other possible configurations of machines to properly represent the production processes involved in producing fruit beverages. The proposed approach is validated by a study carried out in a fruit juice company located in the interior of Sao Paulo State, Brazil, in which the solutions obtained by the models were tested and analyzed in real situations at the company. The results show that the approach is potentially good for practical applications.

show abstract

Section: Introductionmentioning

confidence: 99%

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…FR has been successfully applied in the past mainly to scheduling problems [13,15,16]. In those applications, variables and constraints can naturally be partitioned according to some sequential stages, two consecutive ones being only linked by a few of the variables and constraints of each partition.…”

Section: Introductionmentioning

confidence: 99%

Fix-and-relax approaches for controlled tabular adjustment

Baena

Castro

González

2015

Computers & Operations Research

View full text Add to dashboard Cite

Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR+BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Computers & Operations Research 2011). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR+BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR+BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances.

show abstract

“…Lotsizing and scheduling problems have been extensively reported in the literature, for example, the General Lot sizing and scheduling (GLSP), which takes sequence-dependent and sequence-independent setup times and costs into account (Fleischmann & Meyr, 1997;Drexl & Kimms, 1997;Meyr, 2000;Haase & Kimms, 2000;Araújo et al, 2007Araújo et al, , 2008Ferreira et al, 2009Ferreira et al, , 2010Jans & Degraeve, 2008;Allahverdi et al, 2008;Toso et al, 2009;Clark et al, 2010). 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.…”

Section: Introductionmentioning

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.

Self Cite

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

Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Cited by 82 publications

References 27 publications

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

Otimização da programação da produção de bebidas à base de frutas por meio de modelos de programação inteira mista

Fix-and-relax approaches for controlled tabular adjustment

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

Contact Info

Product

Resources

About