Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Beraldi, Patrizia; Ghiani, Gianpaolo; Grieco, A; Guerriero, Emanuela

doi:10.1016/j.cor.2007.04.003

Cited by 88 publications

(45 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Several studies that propose a relax-and-fix heuristic to solve optimization problems can be found in the literature. For example, relax-and-fix-based heuristics for solving lot sizing and scheduling problems were proposed in [28,[30][31][32][33][34]. The study [35] applied a relax-and-fix based heuristic to solve the travelling umpire problem, whereas Noor-E-Alam et al [36] applied the method to solve large-scale grid-based location, and Kjeldsen et al [37] optimize the production plan for power-generating companies.…”

Section: Literature Reviewmentioning

confidence: 99%

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Rodrigues

Morábito

Yamashita

et al. 2016

Systems

View full text Add to dashboard Cite

This paper examines a ship routing problem with pickup and delivery and time windows for maritime oil transportation, motivated by the production and logistics activities of an oil company operating in the Brazilian coast. The transportation costs from offshore platforms to coastal terminals are an important issue in the search for operational excellence in the oil industry, involving operations that demand agile and effective decision support systems. This paper presents an optimization approach to address this problem, based on a mixed integer programming (MIP) model and a novel and exploratory application of two tailor-made MIP heuristics, based on relax-and-fix and time decomposition procedures. The model minimizes fuel costs of a heterogeneous fleet of oil tankers and costs related to freighting contracts. The model also considers company-specific constraints for offshore oil transportation. Computational experiments based on the mathematical models and the related MIP heuristics are presented for a set of real data provided by the company, which confirm the potential of optimization-based methods to find good solutions for problems of moderate sizes.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Rodrigues

Morábito

Yamashita

et al. 2016

Systems

View full text Add to dashboard Cite

show abstract

“…Relax-and-fix heuristics were applied to different production planning problems including the capacitated single level multi-item lot sizing problem (Federgruen et al 2007), the multi-level lot sizing problem (Stadtler, 2003), and the lot sizing and scheduling problem with parallel machines (Beraldi et al, 2008). It was also used to solve problems in particular applications.…”

Section: Literature Reviewmentioning

confidence: 99%

Integrating order acceptance decisions with flexible due dates in a production planning model with load-dependent lead times

Brahimi

Aouam

Aghezzaf

2014

International Journal of Production Research

View full text Add to dashboard Cite

We consider a tactical planning problem, which integrates production planning decisions together with order acceptance decisions, while taking into account the dependency between workload and lead times. The proposed model determines which orders to accept and in which period they should be produced so that they can be delivered to the customer within the acceptable flexible due dates. When the number of accepted orders increases, the workload and production lead time also increase and this may result in the possibility of missing customer due dates. This problem is formulated as a mixed integer linear program for which two relax-and-fix heuristic solution methods are proposed. The first one decomposes the problem based on time periods while the second decomposes it based on orders. The performances of these heuristics are compared with that of a state-of-the-art commercial solver. Our results show that the time-based relax-and-fix heuristic outperforms the orderbased relax-and-fix heuristic and the solver solution as it yields better integrality gaps for much less CPU effort.

show abstract

“…In order to address the actual sugarcane harvesting planning, Higgins et al (2004b), Higgins & Laredo (2006), as well as Jena & Poggi (2013) proposed methods that aggregate harvest blocks in order to reduce the number of variables involved. In parallel, heuristic methods based on MIP, such as relax-and-fix, presented by Pochet & Wolsey (2006) and fix-and-optimize, proposed by Helber & Sahling (2010), have been widely used to solve the large scale General Lotsizing and Scheduling Problem for Parallel Production Lines, as shown for example in Beraldi et al (2008), Ferreira et al (2009Ferreira et al ( , 2012, Toso et al (2009) and Helber & Sahling (2010). Therefore, this work uses an MIP model to represent the programming and scheduling sugarcane harvesting front problem and proposes heuristic methods to solve this problem in real situations, comprising three integrated heuristics: a harvest block aggregation heuristic, a relax-and-fix constructive heuristic and a fix-and-optimize improvement heuristic.…”

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

Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Cited by 88 publications

References 21 publications

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Integrating order acceptance decisions with flexible due dates in a production planning model with load-dependent lead times

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