Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

DOI10.1287/MOOR.1070.0257MaRDI QIDQ5388050zbMATH OpenOpenAlexFDO

Authors Mathieu Van Vyve

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1070.0257

zbMATH Keywords

capacitated lot-sizingcomplexity

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• An efficient algorithm for the capacitated single item dynamic lot size problem
• An effective algorithm for the capacitated single item lot size problem
• scientific article; zbMATH DE number 780785
• Single-item dynamic lot-sizing problems: an updated survey
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
• Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

Cited in

(22)

• Single-item dynamic lot-sizing problems: an updated survey
• A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
• An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
• Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
• The single-item lot-sizing problem with immediate lost sales
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate
• Production lot-sizing with dynamic capacity adjustment
• Subcontracting and lot-sizing with constant capacities
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
• Discrete multi-module capacitated lot-sizing problems with multiple items
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Improved algorithms for dynamic lot sizing problems with incremental discount
• Capacitated lot sizing problems with inventory bounds
• Multiechelon Lot Sizing: New Complexities and Inequalities
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
• Economic lot sizing problem with tank scheduling
• A genetic algorithm to solve the production lot-sizing problem with capacity adjustment
• Integration of sales and operations: a dynamic mixed-integer programming game
• Optimizing capacity profiles for effective heating management
• Single item lot-sizing with non-decreasing capacities

This page was built for publication: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388050)