A framework for modelling setup carryover in the capacitated lot sizing problem
From MaRDI portal
Publication:4399025
DOI10.1080/00207549508904793zbMath0913.90128OpenAlexW2018911891MaRDI QIDQ4399025
No author found.
Publication date: 17 May 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549508904793
Related Items (11)
On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups ⋮ Single machine multi-product capacitated lot sizing with sequence-dependent setups ⋮ The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times ⋮ Campaign planning in time-indexed model formulations ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
Uses Software
Cites Work
- Facets and algorithms for capacitated lot sizing
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Minimum Change-Over Scheduling of Several Products on One Machine
- An Efficient Algorithm for Multi-Item Scheduling
This page was built for publication: A framework for modelling setup carryover in the capacitated lot sizing problem
