Pages that link to "Item:Q2783984"
From MaRDI portal
The following pages link to An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs (Q2783984):
Displaying 41 items.
- Planning for demand failure: a dynamic lot size model for clinical trial supply chains (Q418060) (← links)
- A graphical approach to solve an investment optimization problem (Q483269) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Capacitated lot size problems with fuzzy capacity (Q597534) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost (Q943784) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
- Inventory lot-sizing with supplier selection (Q1886723) (← links)
- Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount (Q1954948) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
- Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- Impact of Heat Storage Capacity on CHP Unit Commitment Under Power Price Uncertainties (Q2806990) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
- Economic lot sizing with constant capacities and concave inventory costs (Q3120576) (← links)
- Optimising lot sizing and order scheduling with non-linear production rates (Q3163341) (← links)
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (Q3990573) (← links)
- An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs (Q4305773) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Lot sizing with bounded inventory and lost sales (Q5451189) (← links)
- Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)
- Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem (Q6557756) (← links)
- New exact and heuristic algorithms for general production and delivery integration (Q6565384) (← links)