Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
type: Item
instance of: scholarly article
title: Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
zbMATH Open document ID: 1458.90014
author: Rafael A. Melo
author: Jesus Ossian Cunha
author: Hugo Harry Kramer
published in: Computers \& Operations Research
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7023704
zbMATH Keywords: integer programming
zbMATH Keywords: lot-sizing
zbMATH Keywords: remanufacturing
zbMATH Keywords: column generation
zbMATH Keywords: matheuristic
MaRDI profile type: Publication
full work available at URL: j.cor.2018.12.012
OpenAlex ID: W2903981941
cites work: A heuristic approach for big bucket multi-level production planning problems
cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
cites work: A survey on matheuristics for routing problems
cites work: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
cites work: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
cites work: On multi-item economic lot-sizing with remanufacturing and uncapacitated production
cites work: Decomposition Principle for Linear Programs
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: A variable neighborhood search based matheuristic for nurse rostering problems
cites work: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
cites work: Q4266754
cites work: MIP‐and‐refine matheuristic for smart grid energy management
cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
cites work: Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: Dynamic lot sizing with product returns and remanufacturing
cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
Wikidata QID: Q128756066
DOI: 10.1016/J.COR.2018.12.012
description: scientific article; zbMATH DE number 7023704