Lot Sizing with Piecewise Concave Production Costs
From MaRDI portal
Publication:2940066
DOI10.1287/ijoc.2014.0597zbMath1304.90080OpenAlexW2097694137MaRDI QIDQ2940066
Hande Yaman, M. Selim Akturk, Esra Koca
Publication date: 26 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/26398
Related Items (12)
Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ Single-item lot-sizing with quantity discount and bounded inventory ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Combined replenishment and warehousing with contract commitments and flexibilities ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Cites Work
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Polynomial cases of the economic lot sizing problem with cost discounts
- Dynamic Version of the Economic Lot Size Model
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- Capacity Acquisition, Subcontracting, and Lot Sizing
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- The dynamic lot size model with quantity discount
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- The Piecewise Concave Function
This page was built for publication: Lot Sizing with Piecewise Concave Production Costs
