Lot sizing with piecewise concave production costs
From MaRDI portal
Publication:2940066
DOI10.1287/IJOC.2014.0597zbMATH Open1304.90080OpenAlexW2097694137MaRDI QIDQ2940066FDOQ2940066
Authors: Hande Yaman, M. Selim Aktürk, 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
Recommendations
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- Polynomial cases of the economic lot sizing problem with cost discounts
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
Cites Work
- Dynamic version of the economic lot size model
- The Piecewise Concave Function
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- Capacity acquisition, subcontracting, and lot sizing
- Polynomial cases of the economic lot sizing problem with cost discounts
- The dynamic lot size model with quantity discount
- Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
Cited In (16)
- Discrete multi-module capacitated lot-sizing problems with multiple items
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
- Improved algorithms for dynamic lot sizing problems with incremental discount
- Single-item dynamic lot-sizing problems: an updated survey
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
- Combined replenishment and warehousing with contract commitments and flexibilities
- Single-item lot-sizing with quantity discount and bounded inventory
- Lot sizing with minimum order quantity
- Modelling piecewise linear concave costs in a tree partitioning problem
- Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems
- Subcontracting and lot-sizing with constant capacities
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
- Production lot-sizing with dynamic capacity adjustment
This page was built for publication: Lot sizing with piecewise concave production costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940066)
