The multi-item capacitated lot-sizing problem with setup times and shortage costs
From MaRDI portal
Publication:2464221
DOI10.1016/j.ejor.2006.01.053zbMath1146.90381MaRDI QIDQ2464221
Nabil Absi, Safia Kedad-Sidhoum
Publication date: 10 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.053
mixed integer programming; production planning; setup times; capacitated lot-sizing; multi-item; shortage costs; banch-and-cut
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B30: Production models
Related Items
Dynamic lot sizing for multiple products with a new joint replenishment model, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, Models and methods for capacitated lot-sizing problems, Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Valid inequalities for mixed 0-1 programs
- Lot-size models with backlogging: Strong reformulations and cutting planes
- The 0-1 knapsack problem with a single continuous variable
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- On the polyhedral structure of a multi-item production planning model with setup times
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Facets and algorithms for capacitated lot sizing
- The single-item lot-sizing problem with immediate lost sales
- Sequence independent lifting in mixed integer programming
- Single item lot sizing problems
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Dynamic Version of the Economic Lot Size Model
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Uncapacitated lot-sizing: The convex hull of solutions
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Valid Linear Inequalities for Fixed Charge Problems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- The uncapacitated lot-sizing problem with sales and safety stocks
