Lot sizing with minimum order quantity

DOI10.1016/J.DAM.2014.09.015MaRDI QIDQ479047zbMATH OpenOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 5 December 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.09.015

zbMATH Keywords

integer programminglot sizingLP extended formulationminimum-order quantity

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Recommendations

• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
• The single item dynamic lot sizing problem with minimum lot size restriction
• Lot sizing with piecewise concave production costs

Cites work

• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Dynamic version of the economic lot size model
• Inventory replenishment model: lot sizing versus just-in-time delivery.
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Lower bounds in lot-sizing models: A polyhedral study
• Multi-item lot-sizing with joint set-up costs
• ON THE STRUCTURE OF OPTIMAL ORDERING POLICIES FOR STOCHASTIC INVENTORY SYSTEMS WITH MINIMUM ORDER QUANTITY
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Production Planning by Mixed Integer Programming
• Semi-continuous network flow problems
• Single item lot-sizing with non-decreasing capacities
• Valid inequalities and separation for capacitated economic lot sizing

Cited in

(14)

• Minimal elements for product orders
• The Effect of Transfer-Pack Size on Order Quantity
• Relaxations of discrete sets with semicontinuous variables
• Single-item dynamic lot-sizing problems: an updated survey
• A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities
• A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
• A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
• The single item dynamic lot sizing problem with minimum lot size restriction
• The single-item green lot-sizing problem with fixed carbon emissions
• scientific article; zbMATH DE number 4156160 (Why is no real title available?)
• Quadratic convex reformulations for semicontinuous quadratic programming
• A dynamic model for inventory lot-sizing and outbound shipment scheduling with a minimum order amount constraint
• Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities
• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

This page was built for publication: Lot sizing with minimum order quantity

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