MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover

DOI10.1007/978-3-319-45587-7_11zbMath1451.90008OpenAlexW2511856341WikidataQ57659037 ScholiaQ57659037MaRDI QIDQ2835669

Filippo Focacci, Daniel Godard, Xueying Shen, Fabio Furini, Virginie Gabrel

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_11

zbMATH Keywords

mixed integer programminglot-sizingcomputational testssetup carryover

Mathematics Subject Classification ID

Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Cites Work

• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• Lotsizing and scheduling for production planning
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• Lot-sizing with production and delivery time windows
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
• A server for automated performance analysis of benchmarking data
• A modified framework for modelling set-up carryover in the capacitated lotsizing problem
• Dynamic lot‐sizing model with production time windows
• Production Planning by Mixed Integer Programming
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach