Single machine multi-product capacitated lot sizing with sequence-dependent setups

Almada-Lobo, Bernardo; Klabjan, Diego; Carravilla, Maria Antónia; Oliveira, José Fernando

doi:10.1080/00207540601094465

Cited by 103 publications

(56 citation statements)

References 16 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Há vários trabalhos com aplicações práticas do problema integrado de dimensionamento e sequenciamento de lotes. Almada-Lobo et al [1] apresentam um modelo para o planejamento da produção de uma indústria de contêiners de vidro cujas decisões de dimensionamento de lotes são baseadas no modelo Capacitated Lotsizing and Scheduling Problem (CLSP) (e.g. [17]) e as decisões do sequenciamento são formuladas com base no problema do caixeiro viajante assimétrico considerando restrições de setup carryover.…”

Section: Introductionunclassified

Usando o ATSP na Modelagem do Problema Integrado de Produção de Bebidas

Defalque

Rangel

Ferreira

2011

TCAM

View full text Add to dashboard Cite

Resumo. Neste trabalho, propomos um modelo integrado de dimensionamento de lotes e programação da produção monomáquina para uma fábrica de refrigerantes de pequeno porte. As decisões de dimensionamento foram baseadas em um modelo encontrado na literatura e as decisões de sequenciamento foram modeladas utilizando restrições do problema do caixeiro viajante assimétrico. Para a validação do modelo proposto foram feitos testes computacionais com exemplares gerados aleatoriamente, e também exemplares baseados em dados reais obtidos da literatura. Os exemplares foram resolvidos pelo método Branch-and-Cut incluído no pacote computacional CPLEX 10.0. Os resultados mostram que o modelo proposto representa o planejamento da produção em fábricas de bebidas monomáquinas e que, em algumas situações, produz resultados melhores que o modelo da literatura.Palavras-chave. Dimensionamento de lotes , Sequenciamento da produção, Asymetric Traveling Salesman Problem.

show abstract

Section: Introductionunclassified

Usando o ATSP na Modelagem do Problema Integrado de Produção de Bebidas

Defalque

Rangel

Ferreira

2011

TCAM

View full text Add to dashboard Cite

show abstract

“…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

“…Consider the following standard model for the CLSD with sequence-dependent setup costs and times, suggested by Almada-Lobo et al (2007). This problem is essentially modeled in much the same way as the prize collecting salesman (see (Balas (1989)) or the vehicle routing problem (Laporte (1992b)) with additional sub tour elimination constraints.…”

Section: Literature Reviewmentioning

confidence: 99%

“…They assume that up to a given number of setups occur in the time period between any two given products, independently of their demand patterns. Almada-Lobo et al (2007) propose two models that correctly handle sequence-dependent setup times and costs for large-bucket problems (several products/setups may be produced/performed per period), but do not allow setup cross overs, and may result in sub optimal solutions when non triangular setup times and costs exist.…”

Section: Literature Reviewmentioning

confidence: 99%

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Menezes

Clark

Almada-Lobo

2010

J Sched

Self Cite

View full text Add to dashboard Cite

We recommend you cite the published version. The publisher's URL is: http://dx.doi.org/10.1007/s10951-010-0197-6 Refereed: YesThe original publication is available at www.springerlink.com Disclaimer UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited.UWE makes no representation that the use of the materials will not infringe any patent, copyright, trademark or other property or proprietary rights. UWE accepts no liability for any infringement of intellectual property rights in any material deposited but will remove such material from public view pending investigation in the event of an allegation of any such infringement. AbstractIn production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period -in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed integer programming extension for the capacitated lotsizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lotsizing and scheduling models.

show abstract

Single machine multi-product capacitated lot sizing with sequence-dependent setups

Cited by 103 publications

References 16 publications

Usando o ATSP na Modelagem do Problema Integrado de Produção de Bebidas

Usando o ATSP na Modelagem do Problema Integrado de Produção de Bebidas

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

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Contact Info

Product

Resources

About