A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

DOI10.1016/0305-0548(90)90043-7zbMath0691.90018OpenAlexW1964452956MaRDI QIDQ583078

S. Selcuk Erenguc, Yasemin Aksoy

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90043-7

zbMATH Keywords

branch and bound algorithmlinear knapsack problemssingle item T-period lot sizing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items

A dynamic programming algorithm for dynamic lot size models with piecewise linear costs ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Modeling industrial lot sizing problems: a review ⋮ Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale ⋮ A polynomial time algorithm for convex cost lot-sizing problems ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure

Cites Work

• Unnamed Item
• An algorithm for solving a structured class of linear programming problems
• A transportation type aggregate production model with bounds on inventory and backordering
• A capacity constrained singlefacility dynamic lot-size model
• An algorithm for indefinite integer quadratic programming
• Dynamic Version of the Economic Lot Size Model
• Sequential Production Planning Over Time at Minimum Cost
• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• A Transportation Type Aggregate Production Model with Backordering
• Multiproduct dynamic lot-sizing model with coordinated replenishments
• Deterministic Production Planning: Algorithms and Complexity
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Computational Complexity of the Capacitated Lot Size Problem
• Planning Horizons for the Dynamic Lot Size Model with Backlogging
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Bounded Production and Inventory Models with Piecewise Concave Costs
• A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Production Scheduling by the Transportation Method of Linear Programming
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach