Pages that link to "Item:Q3985143"
From MaRDI portal
The following pages link to A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time (Q3985143):
Displaying 50 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
- The lockmaster's problem (Q322695) (← links)
- Improving the efficiency of decentralized supply chains with fixed ordering costs (Q322983) (← links)
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (Q336916) (← links)
- Centralized and decentralized inventory policies for a single-vendor two-buyer system with permissible delay in payments (Q342486) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- Planning for demand failure: a dynamic lot size model for clinical trial supply chains (Q418060) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← 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)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- Inventory replenishment model: lot sizing versus just-in-time delivery. (Q703285) (← links)
- Integrated market selection and production planning: complexity and solution approaches (Q715060) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- Economic lot-sizing games (Q852985) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- An efficient procedure for dynamic lot-sizing model with demand time windows (Q868629) (← links)
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints (Q872255) (← links)
- Loss of customer goodwill in the uncapacitated lot-sizing problem (Q875427) (← links)
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
- On stochastic lot-sizing problems with random lead times (Q943786) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Uncapacitated two-level lot-sizing (Q991455) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters (Q1015306) (← links)
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) (← links)
- An efficient algorithm for the dynamic economic lot size problem (Q1206386) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Dynamic lot-sizing with price changes and price-dependent holding costs (Q1303747) (← links)
- Sensitivity analysis of the economic lot-sizing problem (Q1309816) (← links)
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date (Q1310010) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- Dynamic lot sizing with random demand and non-stationary costs (Q1362520) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Scheduling multimodal transportation systems. (Q1427582) (← links)
- Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
