Capacitated Multi-Item Lot-Sizing Problems with Time Windows

DOI10.1287/opre.1060.0325zbMath1167.90684OpenAlexW2107127118MaRDI QIDQ3392030

Najib M. Najid, Nadjib Brahimi, Stéphane Dauzère-Pérès

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0325

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (20)

Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories ⋮ Dynamic lot sizing with stochastic demand timing ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator ⋮ Pricing for production and delivery flexibility in single-item lot-sizing ⋮ Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty ⋮ Capacitated dynamic lot-sizing problem with delivery/production time windows ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds ⋮ Lot-sizing with production and delivery time windows ⋮ A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows ⋮ 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 ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs ⋮ Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems ⋮ Integrated production planning and order acceptance under uncertainty: a robust optimization approach

Uses Software

• XPRESS

This page was built for publication: Capacitated Multi-Item Lot-Sizing Problems with Time Windows