Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
type: Item
instance of: scholarly article
title: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
zbMATH Open document ID: 1179.90018
author: Florian Sahling
author: Lisbeth Buschkühl
author: Horst Tempelmeier
author: Stefan Helber
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
full work available at URL: dp-400.pdf
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5539854
zbMATH Keywords: lot sizing
zbMATH Keywords: MIP
zbMATH Keywords: decomposition
zbMATH Keywords: MLCLSP-L
describes a project that uses: Mlclsp
MaRDI profile type: Publication
OpenAlex ID: W2034904438
cites work: The Capacitated Lot-Sizing Problem with Linked Lot Sizes
cites work: Time continuity in discrete time models. New approaches for production planning in process industries.
cites work: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: On practical resource allocation for production planning and scheduling with period overlapping setups
cites work: Lotsizing and scheduling for production planning
cites work: A framework for modelling setup carryover in the capacitated lot sizing problem
cites work: A modified framework for modelling set-up carryover in the capacitated lotsizing problem
cites work: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
cites work: Lot-sizing and scheduling for flexible flow lines.
cites work: Conceptual framework for lot-sizing and scheduling of flexible flow lines
cites work: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
cites work: Lot sizing in capacitated production planning and control systems
cites work: Dynamic version of the economic lot size model
cites work: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: Combining population-based and exact methods for multi-level capacitated lot-sizing problems
cites work: The single-item lot-sizing problem with immediate lost sales
cites work: The multi-item capacitated lot-sizing problem with setup times and shortage costs
cites work: Single item lot sizing problems
cites work: Production Planning by Mixed Integer Programming
DOI: 10.1016/J.COR.2008.10.009
description: scientific article; zbMATH DE number 5539854