Partial objective inequalities for the multi-item capacitated lot-sizing problem

DOI10.1016/j.cor.2017.11.006zbMath1391.90215OpenAlexW2769830667MaRDI QIDQ1652548

J. Cole Smith, İ. Esra Büyüktahtakın, Joseph C. Hartman

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.11.006

zbMATH Keywords

dynamic programmingproduction planningcutting planesvalid inequalitiesbranch-and-cutmixed-integer programmingpolyhedral studycapacitated lot-sizingmulti-item\((l, s)\) inequalitiespartial objective cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items

Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem, Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems, Learning optimal solutions via an LSTM-optimization framework, Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem

Uses Software

• bc-prod

Cites Work

• Dynamic programming approximation algorithms for the capacitated lot-sizing problem
• Relaxations for two-level multi-item lot-sizing problems
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
• Multi-item lot-sizing with joint set-up costs
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
• Valid inequalities and separation for capacitated economic lot sizing
• A cutting plane approach to capacitated lot-sizing with start-up costs
• On the polyhedral structure of a multi-item production planning model with setup times
• Dynamic knapsack sets and capacitated lot-sizing
• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Facets of the independent set polytope
• A polyhedral approach to a production planning problem
• Facets and algorithms for capacitated lot sizing
• A study of the lot-sizing polytope
• A computational analysis of lower bounds for big bucket production planning problems
• A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Uncapacitated lot-sizing: The convex hull of solutions
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• Polyhedral Characterization of Discrete Dynamic Programming
• Valid Linear Inequalities for Fixed Charge Problems
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Deterministic Production Planning: Algorithms and Complexity
• Facets of the knapsack polytope
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Parametric approaches to fractional programs
• Production Planning by Mixed Integer Programming
• On Nonlinear Fractional Programming
• An Algorithm for Convex Polytopes