Pages that link to "Item:Q4202457"

The following pages link to Improved Algorithms for Economic Lot Size Problems (Q4202457):

Displaying 50 items.

• An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← 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)
• 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)
• 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)
• Resource downgrading (Q856251) (← 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)
• 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)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← 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)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Dynamic lot-sizing with price changes and price-dependent holding costs (Q1303747) (← links)
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
• Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• A novel decomposition approach for on-line lot-sizing. (Q1582194) (← links)
• Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
• Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
• The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
• Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
• An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
• A dynamic uncapacitated lot-sizing problem with co-production (Q1758049) (← links)
• Joint pricing and inventory management with deterministic demand and costly price adjustment (Q1758284) (← links)