A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
type: Item
instance of: scholarly article
zbMATH Open document ID: 1246.90047
author: K. Haugen
author: G. Lanquepin-Chesnais
author: A. Olstad
publication date: 2012-09-04T00:00:00Z
full work available at URL: https://eudml.org/doc/246843
full work available at URL: http://www.kybernetika.cz/content/2012/2/329
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6076232
zbMATH Keywords: heuristics
zbMATH Keywords: capacitated lot-sizing
zbMATH Keywords: restricted cost structures
describes a project that uses: LOTSIZELIB
describes a project that uses: CPLEX
MaRDI profile type: MaRDI publication profile
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
cites work: Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
cites work: The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
cites work: The profit maximizing capacitated lot-size (PCLSP) problem
cites work: Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
cites work: Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
cites work: A new heuristic approach for the multi-item dynamic lot sizing problem
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Dynamic version of the economic lot size model
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
title: A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
published in: Kybernetika
Recommended article: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
Recommended article: A Lagrangian heuristic for capacitated single item lot sizing problems
Recommended article: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Recommended article: Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
Recommended article: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
description: scientific article; zbMATH DE number 6076232