Lot-sizing with production and delivery time windows

DOI10.1007/s10107-005-0675-3zbMath1111.90078MaRDI QIDQ2492704

Laurence A. Wolsey

Publication date: 14 June 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0675-3

zbMATH Keywords

Convex hull; Mixed integer programming; Lot-sizing; Production time windows

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B30: Production models

Related Items

Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, Modeling industrial lot sizing problems: a review, The economic lot-sizing problem with perishable items and consumption order preference, Pricing for production and delivery flexibility in single-item lot-sizing, A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, Capacitated lot sizing problems with inventory bounds, Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds, Capacitated dynamic lot-sizing problem with delivery/production time windows, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Four equivalent lot-sizing models, Single-item dynamic lot-sizing problems: an updated survey, A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows, A note on ``The economic lot sizing problem with inventory bounds, Convex hull results for generalizations of the constant capacity single node flow set, Multi-item uncapacitated lot sizing problem with inventory bounds, A Lagrangian heuristic for capacitated single item lot sizing problems, Dynamic lot-sizing model for major and minor demands, Dynamic lot-sizing problem with demand time windows and container-based transportation cost, MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover, Just-in-Time Planning and Lot-Sizing, LS-LIB: A Library of Tools for Solving Production Planning Problems, Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales

Cites Work

• Unnamed Item
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Single item lot sizing problems
• A Dynamic Lot-Sizing Model with Demand Time Windows
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Dynamic inventory and pricing models for competing retailers
• Mixing mixed-integer inequalities