Multi-item lot-sizing with joint set-up costs
From MaRDI portal
Publication:1013968
DOI10.1007/s10107-007-0202-9zbMath1170.90005OpenAlexW2170442450MaRDI QIDQ1013968
Laurence A. Wolsey, Michal Tzur, Shoshana Anily
Publication date: 24 April 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0202-9
Integer programming (90C10) Linear programming (90C05) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Capacitated Arc Stabbing, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Capacitated dynamic lot-sizing problem with delivery/production time windows, <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs, A computational analysis of lower bounds for big bucket production planning problems, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, Lot sizing with minimum order quantity, Easy capacitated facility location problems, with connections to lot-sizing, Multi-item lot-sizing with joint set-up costs, Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities
Uses Software
Cites Work
- Multi-item lot-sizing with joint set-up costs
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Approximate extended formulations
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
- Production Planning by Mixed Integer Programming
